Practice
Resources
Contests
Online IDE
New
Free Mock
Events New Scaler
Practice
Improve your coding skills with our resources
Contests
Compete in popular contests with top coders
Events
Attend free live masterclass hosted by top tech professionals
New
Scaler
Explore Offerings by SCALER

Chain of Pairs

Problem Description

Given a `N * 2` array A where (A[i][0], A[i][1]) represents the ith pair.

In every pair, the first number is always smaller than the second number.

A pair (c, d) can follow another pair (a, b) if b < c , similarly in this way a chain of pairs can be formed.

Find the length of the longest chain subsequence which can be formed from a given set of pairs.

Note: A subsequence of a given sequence is a sequence that can be derived from the given sequence by deleting some or no elements without changing the order of the remaining elements.

Problem Constraints

1 <= N <= 103

1 <= A[i][0] < A[i][1] <= 104

Input Format

First and only argument is an 2D integer array A of size `N * 2` representing the N pairs.

Output Format

Return a single integer denoting the length of longest chain subsequence of pairs possible under given constraint.

Example Input

Input 1:

``` A = [  [5, 24]
[39, 60]
[15, 28]
[27, 40]
[50, 90]
]
```

Input 2:

```
A = [   [10, 20]
[1, 2]
]
```

Example Output

Output 1:

``` 3
```

Output 2:

``` 1
```

Example Explanation

Explanation 1:

``` Longest chain that can be formed is of length 3, and the chain is [ [5, 24], [27, 40], [50, 90] ]
```

Explanation 2:

``` Longest chain that can be formed is of length 1, and the chain is [ [1, 2] ] or [ [10, 20] ]
```

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.
Hints
• Hint 1
• Solution Approach
• Complete Solution

Discussion

Free Mock Assessment
Fill up the details for personalised experience.
Phone Number *
OTP will be sent to this number for verification
+1 *
+1
Change Number
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
*Enter the expected year of graduation if you're student
Current Employer
Company Name
College/University Name
Job Title
Job Title
Software Development Engineer (Backend)
Software Development Engineer (Frontend)
Software Development Engineer (Full Stack)
Data Scientist
Android Engineer
iOS Engineer
Devops Engineer
Support Engineer
Research Engineer
Engineering Intern
QA Engineer
Co-founder
SDET
Product Manager
Product Designer
Backend Architect
Program Manager
Release Engineer