Must-do problems: Sliding Window

These are the window problems every placement candidate should be able to solve, from the best total of k days to the minimum window substring. Decide first whether the block size is fixed, then write the loop. Check each program against every test.

1. 1.Best stretch of salesEasy
2. 2.Totals of every stretchEasy
3. 3.Good hoursEasy
4. 4.Most vowels in a rowEasy
5. 5.Quietest stretchEasy
6. 6.Stretches with no repeatsEasy
7. 7.Longest streak above targetEasy
8. 8.Longest text without a repeatMedium
9. 9.Shortest run to reach a targetMedium
10. 10.Longest run within a budgetMedium
11. 11.Streak with a few repairsMedium
12. 12.Hidden rearrangementsMedium
13. 13.Longest piece with limited lettersMedium
14. 14.Longest run after replacementsMedium
15. 15.Is a rearrangement inside?Medium
16. 16.Minimum window substringHard
17. 17.Maximum of every stretchHard
18. 18.Steady stretchHard
19. 19.Cheap bundlesHard
20. 20.Exactly K different lettersHard