Skip to main content
LeetCode 846, Medium. Topics: Array, Hash Table, Greedy, Sorting. View on LeetCode. Generate this problem as a practice environment: tested reference solution, 13 parametrized pytest cases, and a playground notebook:

Problem

Alice has some number of cards and she wants to rearrange the cards into groups so that each group is of size groupSize, and consists of groupSize consecutive cards. Given an integer array hand where hand[i] is the value written on the i<sup>th</sup> card and an integer groupSize, return true if she can rearrange the cards, or false otherwise.

Examples

Constraints

  • 1 <= hand.length <= 10<sup>4</sup>
  • 0 <= hand[i] <= 10<sup>9</sup>
  • 1 <= groupSize <= hand.length
Note: This question is the same as 1296: https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/

Solution

Reference implementation from solution.py on GitHub, full suite in test_solution.py:

Complexity

Tags

NeetCode 150, NeetCode 250, NeetCode All.
Last modified on August 25, 2026