Skip to main content
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

Chat with Fin or Coco right now on mobile.

Start talking through the problem here. Switch to desktop when you're ready to code and run tests.

Start coaching session
Coco
Fin

Meet your coaches

Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.

1Find Target in Sorted Arrayeasy
2Part 2

Start Part 1 to unlock your next challenge

Based onLeetCode

Code + tests need a desktop

Chat works on this phone. Email yourself a link when you want the editor and tests.