128. Longest Consecutive Sequence

Medium

15.3K

632

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:4Explanation: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 <= 10`

^{5}`-10`

^{9}<= nums[i] <= 10^{9}

Accepted

1.1M

Submissions

2.2M

Acceptance Rate

48.5%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved