Given an integer array nums and an integer k, return true if it is possible to partition nums into k non empty subsets such that the sum of elements in every subset is equal, or false otherwise.

Constraints:

• $1 \leq$ k $\leq$ nums.length $\leq 16$

• $1 \leq$ nums[i] $\leq 10^4$

• The frequency of each element is in the range $[1, 4]$.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.