3016. Minimum Number of Pushes to Type Word II
## 思路
計算每個字出現的次數
再照頻率從最高開始的填
## Complexity
Time: O(N)
Spce: O(26)
## Code
```python
class Solution:
def minimumPushes(self, word: str) -> int:
counter = Counter(word)
ans = 0
for idx, cnt in enumerate(sorted(counter.values(), reverse=True)):
ans += cnt * (1 + idx // 8)
return ans
```

大師