lengthOfLIS = (nums) => {
    const subsequence = linearSort(nums);/* Time O(N * N) | Space O(N) */

    return subsequence.length;
}
Array - Subsequence
Time O(N^2) | Space O(N)
https://leetcode.com/problems/longest-increasing-subsequence/
@param {number[]} nums
@return {number}