1357911LMR
easyNeetCode 150

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.

Arrays & HashingBinary Search
👩‍🏫
👨‍💼

Meet Allison & Tim

Your AI coaches

Practice coding interviews out loud with real-time voice coaching. Your code actually runs.

Free · No sign up · Early access
1Find Target in Sorted Arrayeasy
2Part 2

Start Part 1 to unlock your next challenge

Based onLeetCode

Get this problem sent to your inbox