tp2

merge-sorted-array.py

@@ -0,0 +1,25 @@
+# O(n) time, O(1) space
+class Solution:
+    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
+
+    	p1 = m-1
+    	p2 = n-1 
+
+    	idx = m+n-1
+
+    	while p1 >= 0 and p2 >= 0: 
+
+    		if nums1[p1] >= nums2[p2]:
+    			nums1[idx]=nums1[p1]
+    			p1-=1
+    		else:
+    			nums1[idx]=nums2[p2]
+    			p2-=1
+    		idx-=1
+
+    	while p2>=0:
+    		nums1[idx]=nums2[p2]
+    		p2-=1
+    		idx-=1
+
+    	return nums1

remove-dups.py

@@ -0,0 +1,19 @@
+# O(n) time, O(1) space
+class Solution:
+    def removeDuplicates(self, nums: List[int]) -> int:
+
+        cnt = 1
+        slow = 1
+        k=2
+
+        for fast in range(1,len(nums)):
+            if nums[fast] == nums[fast-1]:
+                cnt+=1
+            else:
+                cnt=1
+
+            if cnt <= k:
+                nums[slow]=nums[fast]
+                slow+=1
+
+        return slow

search-2d-matrix-ii.py

@@ -0,0 +1,18 @@
+# O(n+m) time, O(1) space
+class Solution:
+    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
+        m = len(matrix)
+        n = len(matrix[0])
+
+        i=0 # rows
+        j = n-1 # cols
+
+        while i < m and j >= 0:
+            if matrix[i][j]==target:
+                return True 
+            elif matrix[i][j]<target:
+                i+=1
+            else:
+                j-=1
+
+        return False