Longest Consecutive Numbers | Dataford Interview Questions

Find the count of the longest consecutive numbers in an array and optimize it using collections.

Implement longest_consecutive(nums) to return the length of the longest sequence of consecutive integer values. Treat duplicate values as one value, and return 0 for an empty array. The input is a list of integers, and the output is an integer.

Examples: nums = [100, 4, 200, 1, 3, 2] returns 4, and nums = [1, 2, 2, 3] returns 3.

Constraints

0 <= nums.length <= 100000
-1000000000 <= nums[i] <= 1000000000
Duplicate values may appear
Return the length of the longest sequence, not the sequence itself

Function Signature

def longest_consecutive(nums):

Your question is Longest Consecutive Numbers. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Find the count of the longest consecutive numbers in an array and optimize it using collections.

Examples: nums = [100, 4, 200, 1, 3, 2] returns 4, and nums = [1, 2, 2, 3] returns 3.

Constraints

0 <= nums.length <= 100000
-1000000000 <= nums[i] <= 1000000000
Duplicate values may appear
Return the length of the longest sequence, not the sequence itself

Function Signature

def longest_consecutive(nums):

Your question is Longest Consecutive Numbers. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.