Sliding Window

Problem	Complexity	Key Pattern
Longest Substring No Repeat	O(n) -- single pass through the string	Longest valid window — "longest substring/subarray without repeats",
Min Window Substring	O(n) where n = len(s) -- each character visited at most twice	Minimum window containing all required elements — "smallest substring