Arrays & Strings Checkpoint

Sets, windows, stacks, binary search, and intervals.


1. Which structure gives average O(1) lookups to detect duplicates in an array?
2. In a monotonic decreasing stack, you pop while the current value is:
3. After a binary search loop for insertion position, which pointer gives the answer?
4. Two intervals [a,b] and [c,d] overlap (sorted by start) when:
5. Typical time complexity of binary search?