Completed

2D_Matrix.py

@@ -0,0 +1,44 @@
+class Solution:
+    def searchMatrix(self, matrix, target: int) -> bool:
+        outer_low, inner_low = 0,0
+        inner_high = len(matrix[0])-1
+        outer_high = len(matrix)-1
+
+        if matrix[outer_low][inner_low] > target or target > matrix[outer_high][inner_high]:
+            print("Not In The Matrix")
+            return False
+
+        while outer_low <= outer_high:
+            mid = (outer_high + outer_low) // 2
+
+            if matrix[mid][inner_low] <= target <= matrix[mid][inner_high]:
+                break
+
+            elif target > matrix[mid][inner_high]:
+                outer_low = mid + 1
+                mid = (outer_high + outer_low) // 2    
+
+            else:
+                outer_high = mid - 1
+                mid = (outer_high + outer_low) // 2            
+
+        outer_mid = mid
+        low = inner_low
+        high = inner_high
+        arr = matrix[mid]
+
+        while low <= high:
+            mid = (low + high) // 2
+
+            if target == arr[mid]:
+                print("Found at row ", outer_mid," column ", mid)
+                return True
+
+            elif target > arr[mid]:
+                low = mid + 1
+
+            else:
+                high = mid - 1
+
+        #print(outer_mid)
+        return False

Infinite_Sorted_Array.py

@@ -0,0 +1,39 @@
+#Time and Space Complexity O(log n)
+class Solution:
+    def binarysearch(self, arr, low, high, target):
+        while low <= high:
+            mid = (low + high) // 2
+            if arr[mid] == target:
+                return mid
+            elif arr[mid] < target:
+                return self.binarysearch(arr, mid+1, high, target)
+            elif arr[mid] > target:
+                return self.binarysearch(arr, low, mid, target)
+
+
+    def search(self, arr, target: int) -> int:
+        # Your code here
+        low = 0
+        high = 1
+
+        while True:
+            try:
+                if arr[high] >= target:
+                    break
+                high *= 2
+            except IndexError:  # Catches out of bounds exception
+                break
+        low = high // 2
+        high = min(high, len(arr)-1)
+        position = self.binarysearch(arr, low, high, target)
+        print("Target ", target, "is at", position)
+        return position
+
+
+
+sample_arr = [1, 3, 5, 7, 9, 13, 17, 21, 25, 27, 29, 32, 34, 36, 37, 39, 40, 43, 47, 49, 51, 52, 53, 57, 62, 64, 66, 71, 81]
+target = 71
+s_ia = Solution()
+s_ia.search(sample_arr, 1) # At 0
+s_ia.search(sample_arr, 37) # At 14
+s_ia.search(sample_arr, 81) # At 28

RotatedSortedArray.py

@@ -0,0 +1,28 @@
+class Solution:
+    def search(self, nums, target) -> int:
+        low = 0
+        high = len(nums) - 1
+        while low <= high:
+            mid = (low + high) // 2
+            if nums[mid] == target:
+                print(mid)
+                return mid 
+
+            #left Sorted
+            elif nums[low] <= nums[mid]:
+                if nums[low] <= target < nums[mid]:
+                    high = mid - 1
+                else:
+                    low = mid + 1
+            #right sorted
+            else:
+                if nums[mid] < target <= nums[high]:
+                    low = mid + 1
+                else:
+                    high = mid - 1
+        print(-1)   
+        return -1
+
+s = Solution()
+s.search([-2,-1,0,1,3,7,9], 9)
+