Longest Consecutive Subsequence | Dataford Interview Questions

Longest consequent subsequence in the given array

Asked in the technical interview 2 stage. Programming question 2, easy level.

Given an integer array nums, return the length of the longest sequence of consecutive integer values present in the array. The sequence does not need to occupy adjacent positions, and duplicate values count only once.

Function

def longest_consecutive_subsequence(nums): returns an integer.

Constraints

0 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9
The sequence need not be contiguous in the input array
Duplicate values do not increase the sequence length

Function Signature

def longest_consecutive_subsequence(nums):

Your question is Longest Consecutive Subsequence. 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