Meet Allison & Tim
Your AI coaches
Practice coding interviews out loud with real-time voice coaching. Your code actually runs.
Start Part 1 to unlock your next challenge
Binary Search
Find a target in a sorted array. It's the most fundamental divide-and-conquer algorithm, and getting the boundary conditions exactly right is trickier than it looks. Interviewers use it as a baseline—if you fumble binary search, they'll wonder about everything else.
Meet Allison & Tim
Your AI coaches
Practice coding interviews out loud with real-time voice coaching. Your code actually runs.
Desktop required to run this problem
StrongYes runs real code + tests in a desktop editor. Mobile is view-only for now, so you can’t start this here. Sorry about that — email yourself a link and pick it up on your computer.
Start Part 1 to unlock your next challenge
Desktop required
Sorry — mobile can’t run the editor + tests yet. Email yourself a link to continue on desktop.