##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Find smallest window containing all target characters.
Problem: Find the minimum window in containing all characters of .
Approach: Expand until window contains all required characters. Track with a frequency map and counter for satisfied character types. Once valid, shrink from left while maintaining validity, updating the answer.
Time: . Each character visited at most twice.
Space: for frequency maps.
See the implementation unit for code.
