Leetcode 435. Non-overlapping Intervals

Given a list of intervals (endpoints touching allowed), find the minimum number to remove so the remaining intervals are pairwise non-overlapping — equivalently, select the maximum set of non-overlapping intervals (classic interval-scheduling/greedy pattern, n up to 1e5).