← Search

Micro-Drill #49 — Right boundary (bisect_right)

Search Target: 15s

Right boundary search finds the insertion point after equals. Paired with bisect_left for range counting.

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

Type it from memory. Go.

Practice Problems

• 34. Find First and Last Position of Element in Sorted Array
• 744. Find Smallest Letter Greater Than Target

Related Coding Drills

• Drill #51 — Binary search template Easy
• Drill #52 — Find insert position Easy
• Drill #93 — Binary tree right side view Medium