Given an integer array nums and an integer target, determine whether nums can be partitioned into two disjoint subsets such that the product of the elements in each subset is equal to target.

Return true if such a partition exists, and false otherwise.

Constraints:

• $3 \leq$ nums.length $\leq 12$

• $1 \leq$ target $\leq 10^{15}$

• $1 \leq$ nums[i] $\leq 100$

• All elements of nums are distinct.

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.