Binary Search

Verify BST ordering constraints across all nodes

Find LCA using BST ordering

Use inorder order to get sorted BST values

Build a balanced BST from sorted values

Find two numbers in a sorted array that add up to target

Given a sorted array of integers and a target, return the index of the target or -1 if not found

Given a sorted array and a target, return the index if found or where it would be inserted to keep sorted order

Given a sorted array, find the starting and ending position of a target value. Return [-1, -1] if not found

A sorted array has been rotated at some pivot. Search for a target value in O(log n) time

Find the minimum element in a sorted array that has been rotated

Find any element that is strictly greater than its neighbors. nums[-1] = nums[n] = -infinity

Given a version control system where all versions after a bad version are bad, find the first bad version

Koko can eat bananas at speed k per hour. Given piles and h hours, find the minimum k to eat all bananas in time

Find the least weight capacity of a ship so that all packages can be shipped within d days (packages must stay in order)

Split an array into k non-empty continuous subarrays to minimize the largest subarray sum

Search a target in a rotated sorted array that may include duplicates

Find the index of the peak element in a mountain array (strictly increasing then decreasing)

Search for a target in a matrix where each row is sorted and first element of each row is greater than last element of previous row

Find the median of two sorted arrays in O(log(min(m,n))) time

Search for a target in a sorted matrix where each row and each column is sorted ascending

Find the smallest divisor such that sum of ceil(nums[i]/divisor) is within threshold

Pick m bouquets of k adjacent blooms, minimizing flowering day

Place m balls in baskets to maximize minimum distance

Design a key-value store that supports set(key, value, timestamp) and get(key, timestamp) returning value with largest timestamp <= given timestamp