<p>You are given an integer array <code>nums</code>.</p>

<p>You should move each element of <code>nums</code> into one of the two arrays <code>A</code> and <code>B</code> such that <code>A</code> and <code>B</code> are non-empty, and <code>average(A) == average(B)</code>.</p>

<p>Return <code>true</code> if it is possible to achieve that and <code>false</code> otherwise.</p>

<p><strong>Note</strong> that for an array <code>arr</code>, <code>average(arr)</code> is the sum of all the elements of <code>arr</code> over the length of <code>arr</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,3,4,5,6,7,8]
<strong>Output:</strong> true
<strong>Explanation:</strong> We can split the array into [1,4,5,8] and [2,3,6,7], and both of them have an average of 4.5.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [3,1]
<strong>Output:</strong> false
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 30</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 10<sup>4</sup></code></li>
</ul>

class Solution
{
public:
    bool splitArraySameAverage(vector<int> &nums)
    {
        int n = nums.size();
        // find the total sum
        int sum = 0;
        for (int i = 0; i < n; i++)
            sum += nums[i];

        // check for every possible size of subset from 1 to n - 1
        for (int n1 = 1; n1 < n; n1++)
        {
            if ((sum * n1) % n == 0)
            {
                int req_sum = (sum * n1) / n;
                // check if there is any subset of n1 that has sum of req_sum
                if (helper(nums, 0, n, req_sum, n1))
                    return true;
            }
        }

        return false;
    }

private:
    unordered_map<string, int> mp;

    bool helper(vector<int> &nums, int i, int n, int sum, int n1)
    {
        if (n1 == 0)
            return sum == 0;
        if (i == n)
            return false;

        string key = to_string(i) + "#" + to_string(n1) + "#" + to_string(sum);
        // if already calculated
        if (mp.count(key))
            return mp[key];
        // if nums[i] <= sum, then we will either include or exclude
        // calculate the result and store in map
        int include = false, dontInclude = helper(nums, i + 1, n, sum, n1);
        if (dontInclude)
            return mp[key] = dontInclude;

        if (nums[i] <= sum)
            include = helper(nums, i + 1, n, sum - nums[i], n1 - 1);

        return mp[key] = include || dontInclude;
    }
};
355223