Leetcode 757. Set Intersection Size At Least Two

Find the minimum-size set of integers such that every given interval contains at least two numbers from that set. This is a greedy interval-cover variant — sort by interval end and carefully place two points near each end to maximize reuse across overlapping intervals.