# Leetcode: Maximum Length of Pair Chain

Maximum Length of Pair Chain

<a href=”https://github.com/dennyzhang/code.dennyzhang.com/tree/master/problems/maximum-length-of-pair-chain“><img align=”right” width=”200″ height=”183″ src=”” /></a>

Similar Problems:

You are given n pairs of numbers. In every pair, the first number is always smaller than the second number.

Now, we define a pair (c, d) can follow another pair (a, b) if and only if b < c. Chain of pairs can be formed in this fashion.

Given a set of pairs, find the length longest chain which can be formed. You needn’t use up all the given pairs. You can select pairs in any order.

Example 1:

```Input: [[1,2], [2,3], [3,4]]
Output: 2
Explanation: The longest chain is [1,2] -> [3,4]
```

Note:

• The number of given pairs will be in the range [1, 1000].

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.

• Solution: XXX

General Thinkings:

Key Observations:

Walk Through Testdata

```// Blog link: https://code.dennyzhang.com/maximum-length-of-pair-chain
```

<div style=”overflow: hidden;”>