longestConsecutive = (nums) => {
    if (!nums.length) return 0;

    nums.sort((a, b) => a - b);/* Time O(N * log(N)) | Space O(1 || log(N)) */

    return search(nums);       /* Time O(N) */
}
Sort - HeapSort Space O(1) | QuickSort Space O(log(K))
Greedy - Max Score
Time O (N * log(N)) | Space O(1)
https://leetcode.com/problems/longest-consecutive-sequence/
@param {number[]} nums
@return {number}