Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

medium· arrays-hashing Mock interview

Longest Consecutive Sequence

Given an unsorted array `nums`, return the length of the longest run of consecutive integers (values differing by 1), in O(n) time.

Examples

in: nums = [100,4,200,1,3,2]

out: 4

[1,2,3,4]

Constraints

0 <= len(nums) <= 10^5
-10^9 <= nums[i] <= 10^9

Hints

target: O(n) time⌘↩ run · ⇧⌘↩ submit