findTargetSumWays = (nums, target) => {
    const total = nums.reduce((sum, num) => (sum + num), 0);/* Time O(N) */
    const tabu = initTabu(nums, total);                     /* Time O(N * M) | Space O(N * M) */

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

    return (Math.abs(target) <= total)
        ? tabu[(nums.length - 1)][(target + total)]
        : 0;
}
DP - Bottom Up
Matrix - Tabulation
Time O(N * M) | Space O(N * M)
https://leetcode.com/problems/target-sum/
@param {number[]} nums
@param {number} target
@return {number}