Search⌘ K
AI Features
Home
Courses
Learn Data Structures and Algorithms in JavaScript

Problem: Longest Consecutive Sequence

Learn to find the longest consecutive integer sequence in an unsorted array efficiently using hash tables. Understand how to use hash sets to enable O(1) lookups, detect sequence starts, and traverse sequences to calculate their lengths while maintaining O(n) time complexity.

We'll cover the following...

Statement

Given an unsorted array of integers nums, determine the length of the longest sequence of consecutive elements that can be formed from the values in the array.

Your solution must operate in O(n)O(n) time complexity.

Constraints:

  • 0≤0 \leq nums.length ≤105\leq 10^5

  • −109≤ ...