#include <stdio.h>
void sliding_window_sum(int arr[], int n, int k) {
// Your logic here
// if we start to inspect windows of width k
// then we can do it from element 0 to element (n-k)
//
int i, j, sum;
for (i=0; i <= (n-k); i++) {
sum= 0;
for (j=0; j < k; j++) {
sum = sum + arr[i+j];
}
printf ("%d ", sum);
}
printf("\n");
}
int main() {
int n, k, arr[100];
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
sliding_window_sum(arr, n, k);
return 0;
}
Solving Approach
if we start to inspect windows of width k
then we can do it from element 0 to element (n-k)