add 3936

Author: fishercoder1534

paginated_contents/algorithms/4th_thousand/README.md

@@ -12,6 +12,7 @@
 | 3945 | [Digit Frequency Score](https://leetcode.com/problems/digit-frequency-score/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3945.java) |                                                                               | Easy       |
 | 3941 | [Password Strength](https://leetcode.com/problems/password-strength/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3941.java) |                                                                               | Easy       |
 | 3940 | [Limit Occurrences in Sorted Array](https://leetcode.com/problems/limit-occurrences-in-sorted-array/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3940.java) |                                                                               | Easy       |
+| 3936 | [Minimum Swaps to Move Zeros to End](https://leetcode.com/problems/minimum-swaps-to-move-zeros-to-end/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3936.java) |                                                                               | Easy       |
 | 3925 | [Concatenate Array With Reverse](https://leetcode.com/problems/concatenate-array-with-reverse/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3925.java) |                                                                               | Easy       |
 | 3913 | [Sort Vowels by Frequency](https://leetcode.com/problems/sort-vowels-by-frequency/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3913.java) |                                                                               | Easy       |
 | 3908 | [Valid Digit Number](https://leetcode.com/problems/valid-digit-number/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3908.java) |                                                                               | Easy       |

src/main/java/com/fishercoder/solutions/fourththousand/_3936.java

@@ -0,0 +1,38 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3936 {
+    public static class Solution1 {
+        /**
+         * My completely original solution:
+         * two pointer technique:
+         * left pointer keeps looking for the zero number
+         * right pointer keeps looking for the non-zero number
+         * once we find a pair, increase the swap count;
+         * if we don't find a pair, keep moving both pointers.
+         *
+         */
+        public int minimumSwaps(int[] nums) {
+            int minsSwaps = 0;
+            int left = 0;
+            int right = nums.length - 1;
+            while (left < right) {
+                while (left < right && nums[right] == 0) {
+                    right--;
+                }
+                if (left >= right) {
+                    return minsSwaps;
+                }
+                while (left < right && nums[left] != 0) {
+                    left++;
+                }
+                if (left >= right) {
+                    return minsSwaps;
+                }
+                minsSwaps++;
+                left++;
+                right--;
+            }
+            return minsSwaps;
+        }
+    }
+}