Leetcode 239: Sliding Window Maximum
The original question can be found here. The question is asking to find the maximum number inside each sliding window(subarray). […]
solutions
topics
Prefix Sum
Prefix sum is a very useful technique which can be used for some subarray questions. Let’s look at how it
solutions
Leetcode 523: Continuous Subarray Sum
The original question can be found here. This question is quite tricky. I will say best of luck to you