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.