add 2682

Author: fishercoder1534

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

@@ -17,6 +17,7 @@
 | 2706 | [Buy Two Chocolates](https://leetcode.com/problems/buy-two-chocolates/)                                                                                                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2706.java)                                       |                                      | Easy                           |
 | 2697 | [Lexicographically Smallest Palindrome](https://leetcode.com/problems/lexicographically-smallest-palindrome/)                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2697.java)                                       |                                      | Easy                           |
 | 2696 | [Minimum String Length After Removing Substrings](https://leetcode.com/problems/minimum-string-length-after-removing-substrings/)                                                           | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2696.java)                                       |                                      | Easy                           |
+| 2682 | [Find the Losers of the Circular Game](https://leetcode.com/problems/find-the-losers-of-the-circular-game/)                                                                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2682.java)                                       |                                      | Easy                           |
 | 2673 | [Make Costs of Paths Equal in a Binary Tree](https://leetcode.com/problems/make-costs-of-paths-equal-in-a-binary-tree/)                                                                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2673.java)                                       |                                      | Medium                         |Tree, DFS, Greedy
 | 2678 | [Number of Senior Citizens](https://leetcode.com/problems/number-of-senior-citizens/)                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2678.java)                                       |                                      | Easy                           |
 | 2670 | [Find the Distinct Difference Array](https://leetcode.com/problems/find-the-distinct-difference-array/)                                                                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2670.java)                                       |                                      | Easy                           |

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

@@ -0,0 +1,35 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.HashSet;
+import java.util.Set;
+
+public class _2682 {
+    public static class Solution1 {
+        public int[] circularGameLosers(int n, int k) {
+            if (n == 1) {
+                return new int[0];
+            }
+            Set<Integer> met = new HashSet<>();
+            int i = 1;
+            int ball = 1;
+            while (met.add(ball)) {
+                ball += (i * k) % n;
+                if (ball > n) {
+                    ball %= n;
+                }
+                i++;
+            }
+            if (n == met.size()) {
+                return new int[0];
+            }
+            int[] ans = new int[n - met.size()];
+            int q = 0;
+            for (int j = 1; j <= n; j++) {
+                if (!met.contains(j)) {
+                    ans[q++] = j;
+                }
+            }
+            return ans;
+        }
+    }
+}

Diff for: src/test/java/com/fishercoder/thirdthousand/_2682Test.java

@@ -0,0 +1,41 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2682;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+
+public class _2682Test {
+    private static _2682.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2682.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertArrayEquals(new int[]{4, 5}, solution1.circularGameLosers(5, 2));
+    }
+
+    @Test
+    public void test2() {
+        assertArrayEquals(new int[]{}, solution1.circularGameLosers(2, 1));
+    }
+
+    @Test
+    public void test3() {
+        assertArrayEquals(new int[]{3}, solution1.circularGameLosers(3, 1));
+    }
+
+    @Test
+    public void test4() {
+        assertArrayEquals(new int[]{2}, solution1.circularGameLosers(3, 2));
+    }
+
+    @Test
+    public void test5() {
+        assertArrayEquals(new int[]{2, 3}, solution1.circularGameLosers(5, 3));
+    }
+}