Find All Anagrams in a String (LC #438) combines sliding window with character frequency counting. Build a frequency map of the pattern. Slide a window of pattern length across the string. Maintain a frequency map of the current window. When the maps match, record the start index. Optimize by tracking how many characters have the correct frequency instead of comparing full maps. This runs in time and space since the alphabet is fixed at characters. The pattern generalizes to any "find all substrings matching criteria" problem.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/meta-interview-prep/arrays-strings/find-all-anagrams-in-a-string
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████████████████████████████████████████████████████████████████████████████████████████