Algorithmic Problem Under Time | Dataford Interview Questions

Something to do with algorithm.

Implement longest_consecutive(nums), which returns the length of the longest sequence of consecutive integers in an unsorted list. The sequence values must increase by exactly one, and duplicate values count only once.

Input and Output

nums is a list of integers. Return an integer representing the longest consecutive sequence length.

Constraints

0 <= len(nums) <= 10^4
-10^9 <= nums[i] <= 10^9
The input is not necessarily sorted
Duplicate values may appear

Function Signature

def longest_consecutive(nums):

Your question is Algorithmic Problem Under Time. 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