Search⌘ K
AI Features

Problem: Longest Consecutive Sequence

Explore how to identify the longest consecutive sequence in an unsorted integer array by using a hash set for efficient lookups. Understand how to optimize for O(n) time complexity by starting sequences only at their smallest element and iterating through the array with minimal overhead.

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:

  • 00 \leq nums.length 105\leq 10^5

  • 109 ...