Problem editorialmedium
Every anagram of a pattern
An anagram is the same characters in a different order — so forget the letters and track the counts. When the counts match, you have found one.
20 min read·time O(N + M)·space O(1) — 26 counters
Fixed windowCount vectorMatch counter