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

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

    return tabu[1][(nums.length)];
}
DP - Bottom Up
Matrix - Tabulation
Time O(N^3) | Space O(N^2)
https://leetcode.com/problems/burst-balloons/
@param {number[]} nums
@return {number}