Sliding Window Minimum :
Difficulty Level : Easy
Submissions : 431
Asked In :
Marks :10
: 7 | : 0
You are given an array of $$$n$$$ integers and an integer $$$k$$$ You have to select a window of $$$k$$$ contiguous elements from the array whose sum is minimum.
Input
An integer n, $$$(1 \le n \le 10^6)$$$ and k, $$$(1 \le k \le n)$$$ Next line contains n integers, A1,A2,A3....An $$$(-10^8 \le Ai \le 10^8)$$$
Output
A single integer denoting the minimum sum of contiguous subarray of size k.
Example
Input
5 3 1 3 -1 -4 2
Output
-3
Note
Here, we can see that the segment with -1, -4, 2 gives minimum sum of -3
