add 2441

Author: fishercoder1534

paginated_contents/algorithms/3rd_thousand/README.md

@@ -34,6 +34,7 @@
 | 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                                ||
 | 2467 | [Convert the Temperature](https://leetcode.com/problems/convert-the-temperature/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2469.java)                                       || Easy                                ||
 | 2455 | [Average Value of Even Numbers That Are Divisible by Three](https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three/)                                         | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2455.java)                                       || Easy                                ||
+| 2441 | [Largest Positive Integer That Exists With Its Negative](https://leetcode.com/problems/largest-positive-integer-that-exists-with-its-negative/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2441.java)                                       || Easy                                ||
 | 2433 | [Find The Original Array of Prefix Xor](https://leetcode.com/problems/find-the-original-array-of-prefix-xor/)                                                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2433.java)                                       | [:tv:](https://youtu.be/idcT-p_DDrI) | Medium                    ||
 | 2432 | [The Employee That Worked on the Longest Task](https://leetcode.com/problems/the-employee-that-worked-on-the-longest-task/)                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2432.java)                                       || Easy                                ||
 | 2427 | [Number of Common Factors](https://leetcode.com/problems/number-of-common-factors/)                                                                                                           | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2427.java)                                       || Easy                                ||

src/main/java/com/fishercoder/solutions/thirdthousand/_2441.java

@@ -0,0 +1,20 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.HashSet;
+import java.util.Set;
+
+public class _2441 {
+    public static class Solution1 {
+        public int findMaxK(int[] nums) {
+            int maxK = -1;
+            Set<Integer> set = new HashSet<>();
+            for (int i = 0; i < nums.length; i++) {
+                set.add(nums[i]);
+                if (set.contains(-nums[i])) {
+                    maxK = Math.max(maxK, Math.abs(nums[i]));
+                }
+            }
+            return maxK;
+        }
+    }
+}

src/test/java/com/fishercoder/thirdthousand/_2441Test.java

@@ -0,0 +1,21 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2441;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _2441Test {
+    private static _2441.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2441.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(7, solution1.findMaxK(new int[]{-1, 10, 6, 7, -7, 1}));
+    }
+}