Linux Networking and LeetCode | Dataford Interview Questions

Easy/medium level leetcode questions & question about linux&networking

Implement longest_consecutive(nums) to return the length of the longest consecutive-integer sequence in an unsorted list. Duplicate values count once, and an empty list returns 0.

Examples: [100, 4, 200, 1, 3, 2] returns 4; [1, 2, 0, 1] returns 3. Aim for O(n) time and O(n) extra space. nums contains integers and has at most 10^4 elements.

Constraints

0 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9
The input may be unsorted
Duplicate values are allowed

Function Signature

def longest_consecutive(nums):

Your question is Linux Networking and LeetCode. 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