Binary-Search-1 Done

2D.txt

@@ -0,0 +1,23 @@
+class Solution:
+    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
+        if matrix == None and len(Matrix) == 0:
+            return False
+        m = len(matrix)
+        n = len(matrix[0])
+        low = 0
+        high = (m*n) - 1
+        while low <= high:
+            mid = low + (high-low)//2
+            row = mid//n
+            col = mid%n
+            if matrix[row][col] == target:
+                return True
+            elif target > matrix[row][col]:
+                low = mid + 1
+            else:
+                high = mid - 1
+        return False
+
+
+# time = O(log mn)
+# space = O(1)

Rotated_Sorted_Array.txt

@@ -0,0 +1,26 @@
+class Solution:
+    def search(self, nums: List[int], target: int) -> int:
+        if nums == None or len(nums) == 0:
+            return -1
+        n = len(nums)
+        low = 0
+        high = n-1
+
+        while low <= high:
+            mid = low + (high - low)//2
+            if target == nums[mid]:
+                return mid
+            if nums[low] <= nums[mid]:
+                if nums[low] <= target and nums[mid] > target:
+                    high = mid - 1
+                else:
+                    low = mid + 1
+            else:
+                if nums[high] >= target and nums[mid] < target:
+                    low = mid + 1
+                else:
+                    high = mid-1
+        return -1
+
+# time = O(log n)
+# Space = O(1)

Unknown_Length.txt

@@ -0,0 +1,29 @@
+# """
+# This is ArrayReader's API interface.
+# You should not implement it, or speculate about its implementation
+# """
+#class ArrayReader:
+#    def get(self, index: int) -> int:
+
+class Solution:
+    def search(self, reader: 'ArrayReader', target: int) -> int:
+        low = 0
+        high = 1
+        while reader.get(high) < target:
+            low = high
+            high *= 2
+        return self.binarySearch(reader, target, low, high)
+
+    def binarySearch(self, reader: 'ArrayReader', target: int, low: int, high: int) -> int:
+        while low <= high:
+            mid = low + (high-low)//2
+            if reader.get(mid) == target:
+                return mid
+            elif reader.get(mid) < target:
+                low = mid + 1
+            else:
+                high = mid - 1
+        return -1
+
+        # time = O(log n)
+        # space = O(1)