EasyBinary Search
First Bad Version
Find first bad version
Solution Approach
Binary search to find first bad version. Set boundaries and narrow search space by checking middle version.
Implementation
def isBadVersion(n):
left, right = 1, n
while left < right:
mid = (left + right) // 2
if isBadVersion(mid):
right = mid
else:
left = mid + 1
return leftComplexity Analysis
Time Complexity
O(log n)Space Complexity
O(1)Complexity
Time:O(log n)
Space:O(1)
Asked at
GoogleFacebookUber