Problem: Longest Consecutive Sequence

Given an unsorted array, nums, your task is to return the length of the longest consecutive sequence of elements. The consecutive sequence of elements is such that there are no missing elements in the sequence. The consecutive elements can be present anywhere in the input array.

Note: Two elements, $x$ and $y$, are called consecutive if the difference between them is equal to $1$.

Constraints:

• $0 \leq$ nums.lengths $\leq 10^{3}$
• $-10^{6} \leq$ nums[i] $\leq 10^{6}$