lengthOfLIS = (nums) => {
    const subsequence = logarithmicSort(nums);/* Time O(N * log(N) */

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