https://www.lintcode.com/problem/1850 Since Alice and Bob are working on separate consecutive apple trees without overlap, I thought of using sliding window to solve this problem. We can iterate all the possible dividers in the array, and each iteration, we find the… Read More »Lintcode 1850 Pick Apples
https://leetcode.com/problems/grumpy-bookstore-owner/description When I see the minutes is consecutive, I thought of sliding window immediately. We will iterate all the possible window with the fixed length and see which one produces the max result. Let’s take a look at the solution… Read More »Leetcode 1052 Grumpy Bookstore Owner
The first thing comes into mind is sliding window since this is a substring related problem. The idea is pretty simple actually. javascript: Time Complexity:We looped through both t and s once, so the time complexity is O(m + n)… Read More »Leetcode 76 Minimum Window Substring