Partition to K Equal Sum - Read Statement

Given an integer array nums and integer $k$, return true if you can partition the array into $k$ non-empty subsets with equal sums.

Example: For [4,3,2,3,5,2,1] and $k=4$, return true. Four subsets: $(5), (1,4), (2,3), (2,3)$.