maxCoins = (nums) => {
    const _nums = [ 1, ...nums, 1 ];/* Time O(N)         | Space O(N) */

    return search(_nums);           /* Time O(N * N * N) | Space O((N * N) + HEIGHT) */
}
DP - Top Down
Matrix - Memoization
Time O(N^3) | Space O(N^2)
https://leetcode.com/problems/burst-balloons/
@param {number[]} nums
@return {number}