Longest Successive Elements

Moderate

0/80

Contributed by

90 upvotes

Problem statement

There is an integer array ‘A’ of size ‘N’.

A sequence is successive when the adjacent elements of the sequence have a difference of 1.

You must return the length of the longest successive sequence.

Note:

You can reorder the array to form a sequence.

For example,

Input:
A = [5, 8, 3, 2, 1, 4], N = 6
Output:
5
Explanation: 
The resultant sequence can be 1, 2, 3, 4, 5.    
The length of the sequence is 5.

Detailed explanation ( Input/output format, Notes, Images )

Input Format:

The first line contains an integer, ‘N’.
The second line has ‘N’ integers denoting the array ‘A’.

Output Format:-

You must return the length of the longest successive sequence.

Note:-

You don’t need to print anything. Just implement the given function.

Constraints:

1 <= N <= 10^5
1 <= A[i] <= 10^9
Time Limit: 1 sec

Console