Leetcode 278. First Bad Version

Given n versions and an API isBadVersion(version) where once a version is bad all subsequent versions are also bad (monotonic), find the smallest bad version while minimizing API calls — solvable with binary search over [1..n] (watch for large n/overflow).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 278. First Bad Version

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact