[IMP] Two-Pointer-2

merge-sorted-array.py

@@ -0,0 +1,26 @@
+''' 
+Time Complexity : O(n) 
+Space Complexity : O(1) 
+Did this code successfully run on Leetcode : Yes
+Any problem you faced while coding this :  No
+'''
+class Solution:
+    def merge(self, nums1, m, nums2, n):
+        """
+        Do not return anything, modify nums1 in-place instead.
+        """
+        p1 = m - 1
+        p2 = n - 1
+        p3 = m + n - 1
+        while p2 >= 0 and p1 >= 0:
+            if nums2[p2] >= nums1[p1]:
+                nums1[p3] = nums2[p2]
+                p2 -= 1
+            else:
+                nums1[p3] = nums1[p1]
+                p1 -= 1
+            p3 -= 1
+        while p2 >=0:
+            nums1[p3] = nums2[p2]
+            p2 -= 1
+            p3 -= 1

remove-duplicates-from-sorted-array-ii.py

@@ -0,0 +1,21 @@
+''' 
+Time Complexity : O(n) 
+Space Complexity : O(1) 
+Did this code successfully run on Leetcode : Yes
+Any problem you faced while coding this :  No
+'''
+class Solution:
+    def removeDuplicates(self, nums):
+        n = len(nums)
+        slow = 1
+        count = 1
+        for i in range(1, n):
+            if nums[i] == nums[i - 1]:
+                count += 1
+            else:
+                count = 1
+            if count <= 2:
+                nums[slow] = nums[i]
+                slow += 1
+        return slow
+

search-a-2d-matrix-ii.py

@@ -0,0 +1,14 @@
+class Solution:
+    def searchMatrix(self, matrix, target):
+        m = len(matrix)
+        n = len(matrix[0])
+        c = 0
+        r = m - 1
+        while r >= 0 and c < n:
+            if matrix[r][c] == target:
+                return True
+            elif matrix[r][c] > target:
+                r -= 1
+            else:
+                c += 1
+        return False