Leetcode 646. Maximum Length of Pair Chain

Given pairs [left, right] with left < right, find the maximum number of pairs you can select so that each chosen pair's left is strictly greater than the previous pair's right — a longest chain of non-overlapping intervals (classic interval scheduling / longest compatible subsequence problem).