Skip to main content
Admissions guidance, study banks, and career tools — get started on Shalyam

Longest Consecutive Sequence

Medium Hashing

Given an unsorted array of integers, print the length of the longest sequence of consecutive integers. The algorithm must run in O(n) time.

Constraints

0 <= n <= 10^5 -10^9 <= nums[i] <= 10^9

Discussion

No discussions yet.

Rewards · v2.1

Get Exclusive Insights with Every Issue

Join Shalyam Newsletter

Stay ahead in education, research, and innovation—straight to your inbox.