816. Partition to K Equal Sum Subsets

Given an integer array nums and integer k, determine if it's possible to divide nums into k non-empty subsets of equal sum. Return true/false. Input: JSON {nums, k}.

Input: JSON {nums, k}.

Output: Boolean.

Examples

Input: {"nums":[4,3,2,3,5,2,1],"k":4}
Output: true
Explanation: (5),(1,4),(2,3),(2,3).

Input: {"nums":[1,2,3,4],"k":3}
Output: false
Explanation: Sum=10 not divisible by 3.

Constraints

• 1 <= nums.length <= 16
• 1 <= nums[i] <= 10^4
• 1 <= k <= nums.length

Asked by