Halve the search space at every step — from basics to boundary searches
Find the index of a target in a sorted list, or return -1 if not found.
Find the leftmost index of a target in a sorted list with duplicates.
Return the index where a target would be inserted to keep the list sorted.
Count how many elements fall within [lo, hi] using two binary searches.