Implement `countAnagrams(s, p)` returning how many start indices in `s` begin a substring that is an anagram of `p`.
+ 1 hidden test run on Submit.
Comparing fixed-window character counts to the pattern counts finds anagram starts in O(n).
Run your code to see results.