canPartition = (nums) => {
    const sum = getSum(nums);/* Time O(N) */
    const subSetSum = (sum / 2);

    const isEven = ((sum % 2) === 0);
    if (!isEven) return false;

    const index = (nums.length - 1);

    return dfs(nums, index, subSetSum);
}
Brute Force - DFS
Time O(N^2) | Space O(N)
https://leetcode.com/problems/partition-equal-subset-sum/
@param {number[]} nums
@return {boolean}