Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- Partition Array Into Three Parts With Equal Sum
Coding
- Partition Array Into Two Arrays to Minimize Sum Difference
Coding · Array · Binary Search · Bit Manipulation
- Divide an array into subarray with equal sum.
Coding
- Divide Array Into Equal Pairs
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3566. Partition Array into Two Equal Product Subsets
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source