Binary Search Pattern: Coding Interview Guide

When To Use the Binary Search Pattern

Pattern recognition is the meta-skill in coding interviews. Binary Search is the right tool in the following situations, and learning to spot them in under 30 seconds is how strong candidates avoid the brute-force trap.

• Sorted (or rotated sorted) array search
• Find first/last occurrence with custom equality
• Search the answer (min capacity, max distance) where checking is cheaper than computing
• Square root, peak element, median of two sorted arrays

If you see two or more of these signals in the problem statement, default to binary search as your first approach. If the brute-force pass doesn't fit, this is usually the next stop.

Template Code

Memorize this skeleton. In real interviews you should be able to type it from muscle memory in under two minutes, then specialize the inner logic for the specific problem. The bug surface in binary search is usually in the inner conditional, not the outer loop, so getting the boilerplate right protects you from off-by-one mistakes.

def binary_search(arr, target):
    l, r = 0, len(arr) - 1
    while l <= r:
        m = l + (r - l) // 2
        if arr[m] == target:
            return m
        elif arr[m] < target:
            l = m + 1
        else:
            r = m - 1
    return -1

This template is the Python form. The same shape translates directly to Java, C++, Go, and JavaScript; only the container types change. Practicing the template in your strongest language first builds the right mental model before you port it.

Time and Space Complexity

• Time: O(log n)
• Space: O(1) iterative, O(log n) recursive

State the complexity out loud at the start of every problem you solve with this pattern. Interviewers grade on whether you reason about complexity before writing code, not after.

Classic Problems To Practice

Drill these in order. The first 2-3 establish the template, the middle ones add a twist (duplicates, multiple constraints, edge cases), and the last ones combine binary search with a second pattern. Working all of them is roughly 8-12 hours of focused practice.

• Search in Rotated Sorted Array
• Find First and Last Position of Element
• Find Peak Element
• Median of Two Sorted Arrays
• Capacity To Ship Packages Within D Days
• Koko Eating Bananas
• Split Array Largest Sum

After finishing the list, do a timed mock with one problem from this pattern picked at random. If you can solve it in under 25 minutes with no hints and a clean complexity analysis, you have internalized the pattern.

Companies That Ask the Binary Search Pattern

Based on LeakCode's aggregated interview reports, binary search questions appear regularly in coding rounds at the following companies. Click any to see their full question pool.

Patterns are not company-specific in theory but in practice some companies lean harder than others. Meta and Amazon are known for two-pointer and sliding-window heavy phone screens; Google leans graph and DP; Stripe favors design-leaning patterns. Calibrate your prep mix by checking the recent reports for your target company before drilling generic lists.

Common Mistakes

These are the failure modes that show up most in LeakCode reports from candidates who got "no hire" or "weak hire" on rounds where this pattern was expected.

• Using (l + r) / 2 instead of l + (r - l) / 2 (integer overflow in C++/Java)
• Confusing first-occurrence and last-occurrence boundaries
• Wrong loop invariant: while l < r vs while l <= r
• Forgetting that the answer might be at l after the loop

Read each mistake, then write the template again from scratch making sure you handle the corresponding edge case. The mistakes are easier to internalize when you have made them once in a low-stakes context than when you discover them in a real interview.

How To Practice This Pattern

The fastest way to internalize binary search is deliberate practice with constraint, not raw volume. Three sessions of 90 minutes each beat one session of 6 hours because spaced practice consolidates the pattern recognition wiring.

Session 1: read the template, draw the state diagram on paper, then solve the first 3 classic problems with the template visible. Goal is template fluency, not problem solving.

Session 2: solve problems 4-7 without looking at the template. If you blank, look, then close and restart from scratch. Goal is unaided recall of the template under no time pressure.

Session 3: timed mock with the remaining problems on a 25-minute clock each. Talk through complexity out loud as you would in an interview. Goal is performance under interview tempo. After this session, the pattern should feel obvious when you see a matching problem.