Leetcode 3566. Partition Array into Two Equal Product Subsets

Check whether the array can be partitioned into two non-empty disjoint subsets whose element-products both equal target — equivalently verify product(nums) == target^2 and that there exists a non-empty subset with product equal to target; with n ≤ 12 this reduces to a subset-product search (backtracking/DP with pruning).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3566. Partition Array into Two Equal Product Subsets

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact