Alice has a hand of cards, given as an array of integers.
Now she wants to rearrange the cards into groups so that each group is size W, and consists of W consecutive cards.
Return true if and only if she can.
 


Example 1:
Input: hand = [1,2,3,6,2,3,4,7,8], W = 3
Output: true
Explanation: Alice's hand can be rearranged as [1,2,3],[2,3,4],[6,7,8].
Example 2:
Input: hand = [1,2,3,4,5], W = 4
Output: false
Explanation: Alice's hand can't be rearranged into groups of 4.

 
Constraints:

1 <= hand.length <= 10000
0 <= hand[i] <= 10^9
1 <= W <= hand.length

Note: This question is the same as 1296: https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'class Solution:\n    def isNStraightHand(self, hand: List[int], W: int) -> bool:\n        if not hand or len(hand)%W != 0:\n            return False\n        hand_dict = self.get_hand_dict(hand)\n        return self.is_n_straigh_hand(hand_dict, W)\n        \n    def is_n_straigh_hand(self, hand_dict, W):\n        while hand_dict:\n            start_hand = min(hand_dict)\n            count = hand_dict[start_hand]\n            for i in range(start_hand, W + start_hand):\n                if i not in hand_dict:\n                    return False\n                else:\n                    hand_dict[i] -= count\n                    if hand_dict[i] == 0:\n                        del hand_dict[i]\n                    elif hand_dict[i] < 0:\n                        return False\n        return True\n    \n    def get_hand_dict(self, hand):\n        hand_dict = {}\n        for h in hand:\n            hand_dict[h] = hand_dict.get(h, 0)\n            hand_dict[h] += 1\n        return hand_dict\n    \n#         if not hand or len(hand)%W != 0:\n#             return False\n#         result = [[] * W for _ in range(len(hand)//W)]\n#         hand_dict = self.get_dict(hand)\n#         return self.is_n_straight_hand(hand_dict, W, result)\n    \n#     def is_n_straight_hand(self, hand_dict, W, result):\n#         while hand_dict:\n#             min_hand = min(hand_dict)\n#             count = hand_dict[min_hand]\n#             for i in range(min_hand, min_hand + W):\n#                 if i not in hand_dict:\n#                     return False\n#                 hand_dict[i] -= count\n#                 if hand_dict[i] == 0:\n#                     del hand_dict[i]\n#                 elif hand_dict[i] < 0:\n#                     return False\n#         return True\n                    \n            \n    \n#     def get_dict(self, hand):\n#         hand_dict = {}\n#         for i in hand:\n#             hand_dict[i] = hand_dict.get(i, 0) + 1\n#         return hand_dict\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'isNStraightHand'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 5778