Longest Consecutive Sequence
MediumP1Coding
Given an unsorted integer array nums, return the length of the longest run of consecutive integers (values that differ by exactly 1, in any positions in the array). The run does not need to be contiguous in the array.
Aim for O(n) time.
Example 1
- Input
- nums = [100,4,200,1,3,2]
- Output
- 4
- Why
- The run 1, 2, 3, 4 has length 4.
Example 2
- Input
- nums = [0,3,7,2,5,8,4,6,0,1]
- Output
- 9
- Why
- 0 through 8.
Example 3
- Input
- nums = []
- Output
- 0
Constraints
- 0 <= nums.length <= 10^5
- -10^9 <= nums[i] <= 10^9
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 8. ⌘Enter runs, ⌘⇧Enter submits.