longestConsecutive = (nums, maxScore = 0) => {
    for (const num of nums) {/* Time O(N) */
        let [ currNum, score ] = [ num, 1 ];

        while (isStreak(nums, (currNum + 1))) {/* Time O(N * N) */
            currNum++;
            score++;
        }

        maxScore = Math.max(maxScore, score);
    }

    return maxScore;
}
Brute Force
Greedy - Max Score
Time O (N^3) | Space O(1)
https://leetcode.com/problems/longest-consecutive-sequence/
@param {number[]} nums
@return {number}