Leetcode 698. Partition to K Equal Sum Subsets
Determine whether an array of up to 16 small positive integers can be split into k non-empty subsets whose sums are equal. This is a combinatorial partitioning/subset-sum problem (total sum must be divisible by k) that typically requires exhaustive search with strong pruning or bitmask DP due to the exponential state space.
Asked at:
Amazon
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Late February, 2026
Mid-level
Mid January, 2026
Mid-level
Same description as leetcode problem: Given an integer array nums and an integer k, return true if it is possible to divide this array into k non-empty subsets whose sums are all equal.
Hello Interview Premium
Your account is free and you can post anonymously if you choose.