| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

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

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

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

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

packagecom.fishercoder.solutions;

importjava.util.ArrayList;

importjava.util.List;

publicclass_2134 {

publicstaticclassSolution1 {

publicintminSwaps(int[]nums) {

intones =0;

List<Integer>list =newArrayList<>();

for (intnum :nums) {

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++;

}

intlen =right -left +1;

if (len <ones) {

continue;

}elseif (len ==ones) {

minSwaps =Math.min(minSwaps,zeroes);

}else {

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

zeroes--;

}

left++;

minSwaps =Math.min(minSwaps,zeroes);

}

}

returnminSwaps;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._2134;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_2134Test {

privatestatic_2134.Solution1solution1;

privatestaticint[]nums;

publicstaticvoidsetup() {

solution1 =new_2134.Solution1();

}

publicvoidtest1() {

nums =newint[]{0,1,0,1,1,0,0};

assertEquals(1,solution1.minSwaps(nums));

}

publicvoidtest2() {

nums =newint[]{0,1,1,1,0,0,1,1,0};

assertEquals(2,solution1.minSwaps(nums));

}

publicvoidtest3() {

nums =newint[]{1,1,0,0,1};

assertEquals(0,solution1.minSwaps(nums));

}

}