You are given an integer array hand, where each value represents a card rank, and an integer groupSize. Determine whether it is possible to reorder hand so that it can be partitioned into groups of exactly groupSize cards, where each group consists of groupSize consecutive ranks.

Return true if such a partitioning is possible, otherwise return false.

Note: This problem is the same as LeetCode $1296$.

Constraints:

• $1 \leq$ hand.length $\leq 10^4$

• $0 \leq$ hand[i] $\leq 10^9$

• $1 \leq$ groupSize $\leq$ hand.length

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.