30-Minute LeetCode Medium | Dataford Interview Questions

Leetcode medium question, solvable within 30 minutes or so.

Given an unsorted integer array nums, return the length of the longest sequence of consecutive integers. The sequence values must increase by exactly one, and the elements do not need to be adjacent in the input. Implement longest_consecutive(nums) and return an integer.

Constraints

0 <= len(nums) <= 10^4
-10^9 <= nums[i] <= 10^9
Duplicate values may appear

Function Signature

def longest_consecutive(nums):

Your question is 30-Minute LeetCode Medium. 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

Leetcode medium question, solvable within 30 minutes or so.

Constraints

0 <= len(nums) <= 10^4
-10^9 <= nums[i] <= 10^9
Duplicate values may appear

Function Signature

def longest_consecutive(nums):

Your question is 30-Minute LeetCode Medium. 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.