757. Set Intersection Size At Least Two

Find the smallest set of integers S such that every interval contains at least two points of S. This is the "minimum points to stab all intervals" problem (#452's cousin) escalated from one point per…