update 2134

Author: fishercoder1534

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

@@ -213,7 +213,7 @@
 | 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                                 ||

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

@@ -16,11 +16,16 @@ public int minSwaps(int[] nums) {
                 ones += num;
                 list.add(num);
             }
+            //add it again to simulate the circular list
             for (int num : nums) {
                 list.add(num);
             }
             int minSwaps = nums.length;
             int zeroes = 0;
+            //as long as the size of the sliding window is smaller than 1s' count, we keep moving right pointer to the right
+            //as soon as the size of the sliding window is equal to 1s' count, we take the 0s count in this window against minSwaps to update it if possible
+            //then if the size of the sliding window is greater than 1s' count, we move the left pointer to the right
+            //One caveat: you don't really need to make the swaps to solve this problem, just counting the numbers is enough
             for (int left = 0, right = 0; right < list.size(); right++) {
                 if (list.get(right) == 0) {
                     zeroes++;

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

@@ -1,17 +1,17 @@
 package com.fishercoder.thirdthousand;
 
 import com.fishercoder.solutions.thirdthousand._2134;
-import org.junit.BeforeClass;
-import org.junit.Test;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
 
-import static org.junit.Assert.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class _2134Test {
     private static _2134.Solution1 solution1;
     private static int[] nums;
 
-    @BeforeClass
-    public static void setup() {
+    @BeforeEach
+    public void setup() {
         solution1 = new _2134.Solution1();
     }