GoogleCodingMembers
First Bad Version with Parallel Search Follow-up
Members only
Phone-screen R1 coding round. The base problem is the standard first-bad-version monotonic search — given an `isBadVersion(v)` oracle over versions `1..n`, find the first bad version with a single bin...
SWE
binary-search
parallelism
concurrency
medium
Frequency
Single report
Last asked
2026-06-15
Stage
phone-screen
Log in to continue reading the full content
Comments
Sign in to join the discussion
Loading...