Day 11 of LeetCode

🌧️ Rainy Documenting LeetCode solving. Q1 33. Search in Rotated Sorted Array Medium. Binary search class Solution: def search(self, nums: List[int], target: int) -> int: l, r = 0, len(nums) - 1 while l <= r: mid = l ...