Partition to K Equal Sum

Given an integer array nums and an integer k, determine whether it is possible to partition the array into k non-empty subsets where each subset has the same sum.

Examples
Input: [[4,3,2,3,5,2,1],4]
Output: true
Hints

Partition to K Equal Sum

Given an integer array nums and an integer k, determine whether it is possible to partition the array into k non-empty subsets where each subset has the same sum.