Merge branch 'neetcode-gh:main' into main

Author: Aksshay88

README.md

@@ -179,7 +179,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0081 - Search In Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0081-search-in-rotated-sorted-array-ii.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0081-search-in-rotated-sorted-array-ii.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0981 - Time Based Key Value Store](https://leetcode.com/problems/time-based-key-value-store/)</sub> | <sub><div align='center'>[✔️](c%2F0981-time-based-key-value-store.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0981-time-based-key-value-store.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0981-time-based-key-value-store.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0981-time-based-key-value-store.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0981-time-based-key-value-store.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0981-time-based-key-value-store.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0981-time-based-key-value-store.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0981-time-based-key-value-store.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0981-Time-Based-Key-Value-Store.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0981-time-based-key-value-store.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0981-time-based-key-value-store.ts)</div></sub>
 <sub>[0034 - Find First And Last Position of Element In Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0034-find-first-and-last-position-of-element-in-sorted-array.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0034-find-first-and-last-position-of-element-in-sorted-array.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0034-find-first-and-last-position-of-element-in-sorted-array.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0034-find-first-and-last-position-of-element-in-sorted-array.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0034-find-first-and-last-position-of-element-in-sorted-array.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0034-find-first-and-last-position-of-element-in-sorted-array.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0034-find-first-and-last-position-of-element-in-sorted-array.swift)</div></sub> | <sub><div align='center'>❌</div></sub>
-<sub>[1898 - Maximum Number of Removable Characters](https://leetcode.com/problems/maximum-number-of-removable-characters/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](javascript%2F1898-maximum-number-of-removable-characters.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1898-maximum-number-of-removable-characters.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
+<sub>[1898 - Maximum Number of Removable Characters](https://leetcode.com/problems/maximum-number-of-removable-characters/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F1898-maximum-number-of-removable-characters.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F1898-maximum-number-of-removable-characters.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1898-maximum-number-of-removable-characters.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0116 - Populating Next Right Pointers In Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0116-populating-next-right-pointers-in-each-node.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0116-populating-next-right-pointers-in-each-node.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0116-populating-next-right-pointers-in-each-node.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0116-populating-next-right-pointers-in-each-node.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0116-populating-next-right-pointers-in-each-node.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[1268 - Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F1268-search-suggestions-system.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F1268-search-suggestions-system.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1268-search-suggestions-system.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0410 - Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0410-split-array-largest-sum.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0410-split-array-largest-sum.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0410-split-array-largest-sum.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0410-split-array-largest-sum.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
@@ -307,7 +307,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
 <sub>[0078 - Subsets](https://leetcode.com/problems/subsets/)</sub> | <sub><div align='center'>[✔️](c%2F0078-subsets.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0078-subsets.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0078-subsets.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0078-subsets.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0078-subsets.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0078-subsets.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0078-subsets.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0078-subsets.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0078-subsets.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0078-subsets.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0078-subsets.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0078-subsets.ts)</div></sub>
 <sub>[0039 - Combination Sum](https://leetcode.com/problems/combination-sum/)</sub> | <sub><div align='center'>[✔️](c%2F0039-combination-sum.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0039-combination-sum.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0039-combination-sum.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0039-combination-sum.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0039-combination-sum.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0039-combination-sum.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0039-combination-sum.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0039-combination-sum.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0039-combination-sum.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0039-combination-sum.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0039-combination-sum.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0039-combination-sum.ts)</div></sub>
-<sub>[0077 - Combinations](https://leetcode.com/problems/combinations/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0077-combinations.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0077-combinations.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0077-combinations.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0077-combinations.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
+<sub>[0077 - Combinations](https://leetcode.com/problems/combinations/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0077-combinations.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0077-combinations.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0077-combinations.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0077-combinations.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0077-combinations.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0046 - Permutations](https://leetcode.com/problems/permutations/)</sub> | <sub><div align='center'>[✔️](c%2F0046-permutations.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0046-permutations.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0046-permutations.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0046-permutations.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0046-permutations.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0046-permutations.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0046-permutations.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0046-permutations.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0046-permutations.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0046-permutations.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0046-permutations.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0046-permutations.ts)</div></sub>
 <sub>[0090 - Subsets II](https://leetcode.com/problems/subsets-ii/)</sub> | <sub><div align='center'>[✔️](c%2F0090-subsets-ii.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0090-subsets-ii.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0090-subsets-ii.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0090-subsets-ii.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0090-subsets-ii.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0090-subsets-ii.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0090-subsets-ii.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0090-subsets-ii.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0090-subsets-ii.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0090-subsets-ii.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0090-subsets-ii.ts)</div></sub>
 <sub>[0040 - Combination Sum II](https://leetcode.com/problems/combination-sum-ii/)</sub> | <sub><div align='center'>[✔️](c%2F0040-combination-sum-ii.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0040-combination-sum-ii.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0040-combination-sum-ii.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0040-combination-sum-ii.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0040-combination-sum-ii.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0040-combination-sum-ii.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0040-combination-sum-ii.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0040-combination-sum-ii.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0040-combination-sum-ii.rb)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0040-combination-sum-ii.ts)</div></sub>

cpp/0077-combinations.cpp

@@ -0,0 +1,27 @@
+class Solution {
+private:
+    void backtrack(int start, int n, int k, vector<int> &combination, vector<vector<int>> &res){
+            //base case, when size of combination is k, we wanna stop
+            if(combination.size() == k){
+                res.push_back(combination);
+                return;
+            }
+
+            for(int i = start; i<=n; i++){
+                combination.push_back(i);
+                backtrack(i+1, n, k, combination, res);
+                combination.pop_back();
+            }
+        }
+public:
+    vector<vector<int>> combine(int n, int k) {
+        vector<vector<int>> res;
+
+        //initial empty list to pass to the backtrack function
+        vector<int> emptyCombination;
+
+        backtrack(1, n, k, emptyCombination, res);
+
+        return res;
+    }
+};

java/0442-find-all-duplicates-in-an-array.java

@@ -0,0 +1,14 @@
+class Solution {
+    public List<Integer> findDuplicates(int[] nums) {
+        List<Integer> res = new ArrayList<>();
+
+        for (int n : nums) {
+            n = Math.abs(n);
+            if (nums[n - 1] < 0)
+                res.add(n);
+            nums[n - 1] = -nums[n - 1];
+        }
+
+        return res;
+    }
+}

java/0450-delete-node-in-a-bst.java

@@ -24,7 +24,7 @@ public TreeNode deleteNode(TreeNode root, int key) {
             } else if (root.right == null) {
                 return root.left;
             } else {
-                TreeNode minVal = minimumVal(root);
+                TreeNode minVal = minimumVal(root.right);
                 root.val = minVal.val;
                 root.right = deleteNode(root.right, minVal.val);
             }

java/0452-minimum-number-of-arrows-to-burst-balloons.java

@@ -0,0 +1,21 @@
+class Solution {
+    public int findMinArrowShots(int[][] points) {
+        Arrays.sort(points, Comparator.comparingInt((int[] a) -> a[0])
+                              .thenComparingInt((int[] a) -> a[1]));
+
+        var res = points.length;
+        var prev = points[0];
+        for (int i = 1; i < points.length; i++) {
+            int[] curr = points[i];
+            if (curr[0] <= prev[1]) {
+                res--;
+                prev[0] = curr[0];
+                prev[1] = Math.min(curr[1], prev[1]);
+            } else {
+                prev = curr;
+            }
+        }
+
+        return res;
+    }
+}

java/0525-contiguous-array.java

@@ -0,0 +1,28 @@
+class Solution {
+    public int findMaxLength(int[] nums) {
+        int zero = 0;
+        int one = 0;
+        int res = 0;
+
+        HashMap<Integer, Integer> diffIndex = new HashMap<>();
+
+        for (int i = 0; i < nums.length; i++) {
+            int n = nums[i];
+            if (n == 0)
+                zero++;
+            else
+                one++;
+            if (diffIndex.get(one - zero) == null)
+                diffIndex.put(one - zero, i);
+
+            if (one == zero) {
+                res = one + zero;
+            } else {
+                int idx = diffIndex.getOrDefault(one - zero, 0);
+                res = Math.max(res, i - idx);
+            }
+        }
+
+        return res;
+    }
+}

java/0930-binary-subarrays-with-sum.java

@@ -0,0 +1,22 @@
+class Solution {
+    public int numSubarraysWithSum(int[] nums, int goal) {
+        return helper(nums, goal) - helper(nums, goal - 1);
+    }
+    private int helper(int[] nums, int goal){
+        if(goal < 0)
+            return 0;
+
+        int res = 0, sum = 0;
+        int l = 0;
+
+        for(int r = 0; r < nums.length; r++){
+            sum += nums[r];
+            while(sum > goal){
+                sum -= nums[l];
+                l += 1;
+            }
+            res += (r - l + 1);
+        }
+        return res;
+    }
+}

java/1669-merge-in-between-linked-lists.java

@@ -0,0 +1,22 @@
+class Solution {
+    public ListNode mergeInBetween(ListNode list1, int a, int b, ListNode list2) {
+        ListNode curr = list1;
+        int i = 0;
+        while (i < a - 1) {
+            curr = curr.next;
+            i++;
+        }
+
+        ListNode head = curr;
+        while (i <= b) {
+            curr = curr.next;
+            i++;
+        }
+        head.next = list2;
+
+        while (list2.next != null)
+            list2 = list2.next;
+        list2.next = curr;
+        return list1;
+    }
+}