Solve a LeetCode-Style Problem | Dataford Interview Questions

to solve a leet code algorithms question

Implement longest_consecutive(nums) to return the length of the longest sequence of consecutive integers in an unsorted array. The solution should run in expected O(n) time and must not depend on sorting.

Input: a list of integers. Output: an integer length.

Example: [100, 4, 200, 1, 3, 2] returns 4, because 1, 2, 3, 4 is the longest sequence.

Constraints

0 <= nums.length <= 1000
-10^9 <= nums[i] <= 10^9
The input may contain duplicate values
Return 0 when nums is empty

Function Signature

def longest_consecutive(nums):

Your question is Solve a LeetCode-Style Problem. 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