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        # Q: repititions allowed? yes \n        # Q: negative numbers allowed? no \n        # brute force: make a hashmap with the key as hand[i] and value as frequency: O(n)\n        # maintain a sorted list of indexes: O(n*log(n))\n        # make a pass over the sorted list of indexes, and move to next when the frequency goes to 0 -> O(n)\n        # time complexity = O(n*log(n))\n        if (W==1):\n            return True \n        sorted_indexes = []\n        frequency_map = {}\n        for h in hand: \n            if h not in list(frequency_map.keys()):\n                frequency_map[h] = 1\n                # add to sorted list \n                self.addToSortedList(h, sorted_indexes)       \n            else: \n                frequency_map[h] += 1\n                \n        print((sorted_indexes, frequency_map))\n        # using frequency_map, and sorted_indexes, check if consecutive lists can be made \n        index = 0\n        while index < len(sorted_indexes):\n            # start the current W length list with sorted_indexes[index]        \n            for ele in range(sorted_indexes[index], sorted_indexes[index]+W):\n                if ele not in list(frequency_map.keys()) or frequency_map[ele] == 0:\n                    return False\n                \n                frequency_map[ele] -= 1\n            while (index < len(sorted_indexes) and frequency_map[sorted_indexes[index]] == 0):\n                # remove the element from frequency_map\n                frequency_map.pop(sorted_indexes[index])\n                index += 1\n                \n        return len(list(frequency_map.keys())) == 0 \n        \n    def addToSortedList(self, value: int, sorted_list: List[int]):\n        # values are not repeated in the sorted list \n        if (len(sorted_list) == 0):\n            sorted_list.append(value)\n            return\n        #print(\\"---> val:\\" + str(value))\n        low = 0 \n        high = len(sorted_list) - 1\n        while (low < high):\n            mid = math.floor((low+high)/2)\n            #print(mid, low, high)\n            if value < sorted_list[mid]:\n                high = mid - 1\n            elif value > sorted_list[mid]:\n                low = mid + 1\n        #print(value, low, high, sorted_list)\n        if high < 0:\n            sorted_list.insert(0, value)\n        elif value > sorted_list[high]:\n            sorted_list.insert(high+1, value)\n        else:\n            sorted_list.insert(high, value)\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: 8162