How should I practice Longest Consecutive Sequence?

Start by reading the full statement, solve the visible examples, then compare the pattern against related EPAM phone screen problems in FastPrep.

Is Longest Consecutive Sequence associated with EPAM?

FastPrep tags this as a EPAM phone screen coding practice problem when the problem catalog has that company and stage context.

EPAM● MediumFULLTIMEPHONE SCREEN

Given an unsorted integer array nums, return the length of the longest sequence of consecutive integer values.

The values of a sequence do not need to appear consecutively in the input. Design an algorithm with expected O(n) time.

longestConsecutive(nums: int[]) → int

nums = [100,4,200,1,3,2]return = 4

The longest sequence is 1,2,3,4.

nums = [0,3,7,2,5,8,4,6,0,1]return = 9

The values from 0 through 8 are all present.

Source note: Author-written prompt excerpt retained for source fidelity.