Find the best day to buy and the best later day to sell a stock to maximize your profit.
Find the longest stretch of characters in a string where no character appears twice.
You can change up to k letters in a string. Find the longest stretch you can make all the same character.
Check if any rearrangement of s1 appears as a contiguous chunk inside s2.
Find the shortest piece of string s that contains every character from string t.
As a window of size k slides across the array, report the biggest number in each window position.