Given an unsorted array of integers, find the length of the longest consecutive element sequence.
You must write an algorithm that runs in O(n) time complexity.
Example:
Input: [100, 4, 200, 1, 3, 2]
Output: 4
Explanation: The longest consecutive sequence is [1, 2, 3, 4], which has a length of 4
