Quiz

An array is sorted, and the task is to count the pairs whose sum is below a target. Which approach fits best?

Two pointers, O(n)

A hash map of complements, O(n)

A binary search for each element, O(n log n)