Problem Link:
https://codeforces.com/contest/1690/problem/D
Note: This is quite an interesting problem for cumulative sum or prefix sum.
Solution
#include <bits/stdc++.h>
using namespace std;
int a[200005];
queue<int> q;
int main ()
{
int t;
cin>>t;
int n,k;
string s;
for(int z=0;z<t; z++)
{
cin>>n>>k;
cin>>s;
bool d=0;
for(int i=1;i<=n;i++)
{
if(s[i-1]=='W') a[i]=a[i-1]+1;
else a[i]=a[i-1];
}
int mini=20000005;
for(int i=k;i<=n;i++)
{
mini=min(mini,a[i]-a[i-k]);
}
cout<<mini<<endl;
}
return 0;
}