← Search

Micro-Drill #46 — Binary search template

Search Target: 15s

The standard binary search template. Foundation for all logarithmic search problems.

lo, hi = 0, len(a) - 1
while lo <= hi:
    mid = lo + (hi - lo) // 2
    if a[mid] == target: return mid
    elif a[mid] < target: lo = mid + 1
    else: hi = mid - 1

Type it from memory. Go.

Practice Problems

• 704. Binary Search
• 33. Search in Rotated Sorted Array

Related Coding Drills

• Drill #51 — Binary search template Easy
• Drill #52 — Find insert position Easy
• Drill #81 — Word search Medium