Practice Longest Consecutive Sequence
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence. You must write an algorithm that runs in O(n) time.
Source: Longest Consecutive Sequence on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [100,4,200,1,3,2]
Output
4
# Example 2
Input
nums = [0,3,7,2,5,8,4,6,0,1]
Output
9
# Example 3
Input
nums = [1,0,1,2]
Output
3
Constraints
0 <= nums.length <= 10^5
-10^9 <= nums[i] <= 10^9
Related LeetCode Problems
Practice more problems similar to Longest Consecutive Sequence.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.