Finding K-size sub array with minimum sum
Given an array of size N and a number K. We have to find the sub-array of size K such that the sum of it’s elements is minimum among all K-size sub arrays. For example Let us consider the following array of size 10. {1, 2, 1, 3, 1, 1, 1, 4, 2, 3} The…