add 2481

Author: fishercoder1534

Diff for: paginated_contents/algorithms/3rd_thousand/README.md

@@ -44,7 +44,8 @@
 | 2515 | [Shortest Distance to Target String in a Circular Array](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array/)                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2515.java)                                       || Easy                                 ||
 | 2506 | [Count Pairs Of Similar Strings](https://leetcode.com/problems/count-pairs-of-similar-strings/)                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2506.java)                                       || Easy                                 ||
 | 2496 | [Maximum Value of a String in an Array](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/)                                                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2496.java)                                       || Easy                                 ||
-| 2492 | [Minimum Score of a Path Between Two Cities](https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2492.java)                                       || Medium                               | Union Find                     
+| 2492 | [Minimum Score of a Path Between Two Cities](https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2492.java)                                       || Medium                               | Union Find
+| 2481 | [Minimum Cuts to Divide a Circle](https://leetcode.com/problems/minimum-cuts-to-divide-a-circle/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2481.java)                                       || Easy                                 | 
 | 2487 | [Remove Nodes From Linked List](https://leetcode.com/problems/remove-nodes-from-linked-list/)                                                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2487.java)                                       || Medium                               | LinkedList, Stack              
 | 2485 | [Find the Pivot Integer](https://leetcode.com/problems/find-the-pivot-integer/)                                                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2485.java)                                       || Easy                                 ||
 | 2475 | [Number of Unequal Triplets in Array](https://leetcode.com/problems/number-of-unequal-triplets-in-array/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2475.java)                                       || Easy                                 ||

Diff for: src/main/java/com/fishercoder/solutions/thirdthousand/_2481.java

@@ -0,0 +1,15 @@
+package com.fishercoder.solutions.thirdthousand;
+
+public class _2481 {
+    public static class Solution1 {
+        public int numberOfCuts(int n) {
+            if (n == 1) {
+                return 0;
+            }
+            if (n % 2 == 0) {
+                return n / 2;
+            }
+            return n;
+        }
+    }
+}