Partition Array Into K-Distinct Groups

Determine whether the array can be partitioned into n/k groups of size k (using every element exactly once) such that each group contains only distinct values. Key constraint: n must be divisible by k, and no value's frequency can exceed the number of groups (n/k), since duplicates must go into different groups.