##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Contiguous elements
New problem type: find some property of contiguous subarrays. Maybe the maximum sum, or the longest with distinct elements, or the shortest with sum at least .
Brute force: enumerate all subarrays. There are of them, and processing each takes . That's . Sliding window reduces this to for many problems.
