Maximum Length of Pair Chain

Medium

Problem

You are given an array of n pairs pairs where pairs[i] = [left_i, right_i] and left_i < right_i.

A pair p2 = [c, d] follows a pair p1 = [a, b] if b < c. A chain of pairs can be formed in this fashion.

Return the length of the longest chain which can be formed.

You do not need to use up all the given intervals. You can select pairs in any order.

Input: pairs = [[1,2],[2,3],[3,4]]

Output: 2

The longest chain is [1,2] -> [3,4]. Note that [1,2] -> [2,3] is invalid because 2 is not strictly less than 2.

Input: pairs = [[1,2],[7,8],[4,5]]

Output: 3

The longest chain is [1,2] -> [4,5] -> [7,8].

Loading...

Loading Python...