Search
⌘K
Get Premium
Leetcode 1681. Minimum Incompatibility
Partition an array of up to 16 numbers into k equal-size subsets with no duplicate within any subset, minimizing the sum of each subset's incompatibility (max − min), or return -1 if impossible. The core challenge is selecting disjoint valid subsets (exponentially many) to minimize total cost under the equal-size and uniqueness constraints.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.