LeetCode Easy to Medium | Dataford Interview Questions

General leetcode style easy to medium.

Given an unsorted list of integers nums, return the length of the longest sequence of consecutive integers. The sequence values must increase by exactly one, and the integers do not need to be adjacent in nums. Implement def longest_consecutive(nums):, accepting a list of integers and returning an integer.

Constraints

0 <= nums.length <= 500
-10^9 <= nums[i] <= 10^9
Duplicate values may appear
Return 0 when nums is empty

Function Signature

def longest_consecutive(nums):

Your question is LeetCode Easy to 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

General leetcode style easy to medium.

Constraints

0 <= nums.length <= 500
-10^9 <= nums[i] <= 10^9
Duplicate values may appear
Return 0 when nums is empty

Function Signature

def longest_consecutive(nums):

Your question is LeetCode Easy to 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.