<p>Given an array of integers <code>nums</code> and a positive integer <code>k</code>, check whether it is possible to divide this array into sets of <code>k</code> consecutive numbers.</p>

<p>Return <code>true</code> <em>if it is possible</em>.<strong> </strong>Otherwise, return <code>false</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,3,3,4,4,5,6], k = 4
<strong>Output:</strong> true
<strong>Explanation:</strong> Array can be divided into [1,2,3,4] and [3,4,5,6].
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [3,2,1,2,3,4,3,4,5,9,10,11], k = 3
<strong>Output:</strong> true
<strong>Explanation:</strong> Array can be divided into [1,2,3] , [2,3,4] , [3,4,5] and [9,10,11].
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,3,4], k = 3
<strong>Output:</strong> false
<strong>Explanation:</strong> Each array should be divided in subarrays of size 3.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= k &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
</ul>

<p>&nbsp;</p>
<strong>Note:</strong> This question is the same as&nbsp;846:&nbsp;<a href="https://leetcode.com/problems/hand-of-straights/" target="_blank">https://leetcode.com/problems/hand-of-straights/</a>
class Solution:
    def isPossibleDivide(self, nums: List[int], k: int) -> bool:
        hand = nums
        groupSize = k
        if len(hand) % groupSize != 0:
            return False
        cards = {}
        for x in hand:
            if x not in cards:
                cards[x] = 1
            else:
                cards[x] += 1
        # then we get the lowest.. and keep simulating until none left (or it fails the constraint)
        sorted_cards = []
        for k in cards:
            sorted_cards.append([k, cards[k]])
        sorted_cards.sort()
        cards = sorted_cards
        c_idx = 0
        while c_idx < len(cards):
            # choose lowest..
            if cards[c_idx][1] >= 1:
                cards[c_idx][1] -= 1
                val = cards[c_idx]
                if c_idx + groupSize > len(cards):
                    return False
                # then check and decrement
                for r_idx in range(1, groupSize):
                    if cards[c_idx + r_idx][0] != val[0] + r_idx or cards[c_idx + r_idx][1] == 0:
                        return False
                    cards[c_idx + r_idx][1] = cards[c_idx + r_idx][1] - 1
            else:
                c_idx += 1

        return True
39600