Time: 228 ms (7.9%), Space: 17.9 MB (48.01%) - LeetHub

Author: 0marSalah

0792-binary-search/0792-binary-search.py

@@ -0,0 +1,15 @@
+class Solution:
+    def search(self, nums: List[int], target: int) -> int:
+        if target not in nums:
+            return -1
+        
+        left, right = 0, len(nums)
+        
+        while left < right:
+            mid = (left + right) // 2
+            if nums[mid] < target:
+                left = mid + 1
+            else:
+                right = mid
+        
+        return left