Leetcode 349: Intersection of two arrays
The original question can be found here. The question is aksing for the intersection of two arrays, and element in […]
The original question can be found here. The question is aksing for the intersection of two arrays, and element in […]
The original question can be found here. It’s asking us to merge array nums2 into array nums1. The most straightforward
The orignal question can be found here. The question is asking the number of subarrays which the sum value equals
The original question can be found here. The question is aksing for the largest sum of the subarray. We can
The original question can be found here. The question is asking to find the maximum number inside each sliding window(subarray).
Prefix sum is a very useful technique which can be used for some subarray questions. Let’s look at how it
The original question can be found here. This question is quite tricky. I will say best of luck to you