128. Longest Consecutive Sequence
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.
Example 1:
Input: nums = [100,4,200,1,3,2]
Output: 4
Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4.
Example 2:
Input: nums = [0,3,7,2,5,8,4,6,0,1] Output: 9
Constraints:
0 <= nums.length <= 105-109 <= nums[i] <= 109
Asked at top 20 of 40 companies
Google
IBMTopics
Loading editor…
1class Solution:
2 def longestConsecutive(self, nums: List[int]) -> int:
3
Starter codePython 3Spaces: 4
Loading editor…
1class Solution:
2 def longestConsecutive(self, nums: List[int]) -> int:
3
Starter codePython 3Spaces: 4
Examples
Input
[100,4,200,1,3,2]
Input
[0,3,7,2,5,8,4,6,0,1]
Input
[1,0,1,2]
Your code is saved on this device.Solution