LeetCode-Style Problem in Python | Dataford Interview Questions

Given a mid-difficulty LeetCode-style problem, solve it in Python under interview constraints.

Implement longest_consecutive(nums), which returns the length of the longest sequence of consecutive integers in an unsorted array. Values may appear more than once, and the sequence does not need to preserve the array's order. Aim for O(n) average time.

Input is a list of integers. Output is an integer. Return 0 for an empty list.

Constraints

0 <= nums.length <= 10^5
-10^9 <= nums[i] <= 10^9
The input may contain duplicate values
The expected average time complexity is O(n)

Function Signature

def longest_consecutive(nums):

Your question is LeetCode-Style Problem in Python. 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

Given a mid-difficulty LeetCode-style problem, solve it in Python under interview constraints.

Input is a list of integers. Output is an integer. Return 0 for an empty list.

Constraints

0 <= nums.length <= 10^5
-10^9 <= nums[i] <= 10^9
The input may contain duplicate values
The expected average time complexity is O(n)

Function Signature

def longest_consecutive(nums):

Your question is LeetCode-Style Problem in Python. 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.