3659. Partition Array Into K-Distinct Groups
Asked by 1 company
Topics
You are given an integer array nums and an integer k.
Your task is to determine whether it is possible to partition all elements of nums into one or more groups such that:
- Each group contains exactly
kelements. - All elements in each group are distinct.
- Each element in
numsmust be assigned to exactly one group.
Return true if such a partition is possible, otherwise return false.
Example 1:
Input: nums = [1,2,3,4], k = 2
Output: true
Explanation:
One possible partition is to have 2 groups:
- Group 1:
[1, 2] - Group 2:
[3, 4]
Each group contains k = 2 distinct elements, and all elements are used exactly once.
Example 2:
Input: nums = [3,5,2,2], k = 2
Output: true
Explanation:
One possible partition is to have 2 groups:
- Group 1:
[2, 3] - Group 2:
[2, 5]
Each group contains k = 2 distinct elements, and all elements are used exactly once.
Example 3:
Input: nums = [1,5,2,3], k = 3
Output: false
Explanation:
We cannot form groups of k = 3 distinct elements using all values exactly once.
Constraints:
1 <= nums.length <= 1051 <= nums[i] <= 1051 <= k <= nums.length
Hints
Hint 1
k you need to form.Hint 2
k distinct elements.Hint 3
groups, it cannot be placed uniquely in each group.Hint 4
freq to count the occurrences of each element.Hint 5
n is not divisible by k, partitioning is impossible.