Start Learning

Binary Search

Practice Binary Search problems for coding interviews.

0/7

completed

Easy O(log N)

Median of Two Sorted Arrays

Hard O(log(min(M, N)))

Find Minimum in Rotated Sorted Array

Medium O(log N)

Koko Eating Bananas

Medium O(N * log M)

Search a 2D Matrix

Medium O(log(M * N))

Search in Rotated Sorted Array

Medium O(log N)

Time Based Key-Value Store

Medium O(1) for set, O(log N) for get