Codeforces Round 855 Div 3 | Problem B : Count The Number Of Pairs Solution |Explanation+Code| Hindi

[@vimalkumardubey6834]

Sir can you please share your codeforces id?

[@KaranMashru]

Code :
#include
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);

ll t, n, k, i, j, c1[26], c2[26], ans, extra;
string a;

cin>>t;

for(;t--;)
{
cin>>n>>k;

cin>>a;

for(i=0; i

[@judgebot7353]

waiting for D,E1,E2,F