> For the complete documentation index, see [llms.txt](https://jaywin.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://jaywin.gitbook.io/leetcode/solutions/1296-divide-array-in-sets-of-k-consecutive-numbers.md).

# 1296. Divide Array in Sets of K Consecutive Numbers

<https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers>

## Description

Given an array of integers `nums` and a positive integer `k`, find whether it is possible to divide this array into sets of `k` consecutive numbers.

Return `true` *if it is possible*.Otherwise, return `false`.

**Example 1:**

```
**Input:** nums = [1,2,3,3,4,4,5,6], k = 4
**Output:** true
**Explanation:** Array can be divided into [1,2,3,4] and [3,4,5,6].
```

**Example 2:**

```
**Input:** nums = [3,2,1,2,3,4,3,4,5,9,10,11], k = 3
**Output:** true
**Explanation:** Array can be divided into [1,2,3] , [2,3,4] , [3,4,5] and [9,10,11].
```

**Example 3:**

```
**Input:** nums = [3,3,2,2,1,1], k = 3
**Output:** true
```

**Example 4:**

```
**Input:** nums = [1,2,3,4], k = 3
**Output:** false
**Explanation:** Each array should be divided in subarrays of size 3.
```

**Constraints:**

* `1 <= k <= nums.length <= 105`
* `1 <= nums[i] <= 109`

**Note:** This question is the same as 846: <https://leetcode.com/problems/hand-of-straights/>

## ac

```java
```