Skip to content

problem9.md

Latest commit

 

History

History
19 lines (14 loc) · 587 Bytes

problem9.md

File metadata and controls

19 lines (14 loc) · 587 Bytes

Problem 9: Consecutive Sequence Discovery

Problem Statement

Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence. You must find an algorithm that runs in O(N) time.

Input Format

  • An array of integers nums.

Output Format

  • An integer representing the length of the longest sequence.

Constraints

  • 0 <= nums.length <= 10^5
  • -10^9 <= nums[i] <= 10^9

Example

Input: nums = [100, 4, 200, 1, 3, 2]
Output: 4
Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Its length is 4.