LeetCode Question · Dec 2022 · Los Angeles

Python Easy to understand code || Microsoft || Amazon ( •́ .̫ •̀ )

1 upvote 106 views

Question Details

class Solution: def firstBadVersion(self, n: int) -> int: l=1 h=n result=n while l<=h: mid=(l+h)//2 if isBadVersion(mid)==True: result=mid if isBadVersion(mid-1)==False: return mid else: h=mid-1 else: l=mid+1 return mid

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Coding