Leetcode Problem 646. Maximum Length of Pair Chain

Algorithm

1. Sort the pairs array based on the second element of each pair.
2. Initialize curr to a very small value to represent the end of the current chain.
3. Initialize ans to 0 to keep track of the length of the longest chain.
4. Iterate over each pair in the sorted pairs array:
   • If the first element of pair is greater than curr, increment ans by 1 and update curr to the second element of pair.
5. Return ans as the length of the longest chain.