| 2139|[Minimum Moves to Reach Target Score](https://leetcode.com/problems/minimum-moves-to-reach-target-score/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2139.java)|| Medium||

| 2138|[Divide a String Into Groups of Size k](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2138.java)|| Easy||

| 2135|[Count Words Obtained After Adding a Letter](https://leetcode.com/problems/count-words-obtained-after-adding-a-letter/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2135.java)|| Medium||

| 2134|[Minimum Swaps to Group All 1's Together II](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2134.java)|| Medium||

| 2134 |[Minimum Swaps to Group All 1's Together II](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/) |[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2134.java) || Medium |Array, Sliding Window

| 2133|[Check if Every Row and Column Contains All Numbers](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2133.java)|| Easy||

| 2130|[Maximum Twin Sum of a Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2130.java)|| Medium||

| 2129|[Capitalize the Title](https://leetcode.com/problems/capitalize-the-title/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2129.java)|| Easy||

ones +=num;

list.add(num);

}

for (intnum :nums) {

list.add(num);

}

intminSwaps =nums.length;

intzeroes =0;

for (intleft =0,right =0;right <list.size();right++) {

if (list.get(right) ==0) {

zeroes++;

packagecom.fishercoder.thirdthousand;

importcom.fishercoder.solutions.thirdthousand._2134;

importorg.junit.BeforeClass;

importorg.junit.Test;

importorg.junit.jupiter.api.BeforeEach;

importorg.junit.jupiter.api.Test;

importstaticorg.junit.Assert.assertEquals;

importstaticorg.junit.jupiter.api.Assertions.assertEquals;

publicclass_2134Test {

privatestatic_2134.Solution1solution1;

privatestaticint[]nums;

publicstaticvoidsetup() {

publicvoidsetup() {

solution1 =new_2134.Solution1();

}