lengthOfLIS = (nums) => {
    const tabu = initTabu(nums);/*               | Space O(N) */

    linearSearch(nums, tabu);   /* Time O(N * N) | Space O(N)*/

    return Math.max(...tabu);   /* Time O(N) */
}
DP - Bottom Up
Array - Tabulation
Time O(N^2) | Space O(N)
https://leetcode.com/problems/longest-increasing-subsequence/
@param {number[]} nums
@return {number}