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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.