partition-array-into-k-distinct-groups

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>nums</code> and an integer <code>k</code>.

Your task is to determine whether it is possible to partition all elements of <code>nums</code> into one or more groups such that:

<ul>
	<li>Each group contains exactly <code>k</code> elements.</li>
	<li>All elements in each group are distinct.</li>
	<li>Each element in <code>nums</code> must be assigned to exactly one group.</li>
</ul>

Return <code>true</code> if such a partition is possible, otherwise return <code>false</code>.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [1,2,3,4], k = 2

Output: true

Explanation:

One possible partition is to have 2 groups:

<ul>
	<li>Group 1: <code>[1, 2]</code></li>
	<li>Group 2: <code>[3, 4]</code></li>
</ul>

Each group contains <code>k = 2</code> distinct elements, and all elements are used exactly once.
</div>

Example 2:

<div class="example-block">
Input: nums = [3,5,2,2], k = 2

Output: true

Explanation:

One possible partition is to have 2 groups:

<ul>
	<li>Group 1: <code>[2, 3]</code></li>
	<li>Group 2: <code>[2, 5]</code></li>
</ul>

Each group contains <code>k = 2</code> distinct elements, and all elements are used exactly once.
</div>

Example 3:

<div class="example-block">
Input: nums = [1,5,2,3], k = 3

Output: false

Explanation:

We cannot form groups of <code>k = 3</code> distinct elements using all values exactly once.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 105</code></li>
	<li><code>​​​​​​​1 &lt;= k &lt;= nums.length</code></li>
</ul>