CodeChef Starters 30 Division 4 (Rated) Swapping Chefs Way Problem Code: SWAPCW Solution

  Problem Link :  https://www.codechef.com/problems/SWAPCW

Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include <bits/stdc++.h>

using namespace std;

int main()

{

    int n,t,i,l,r;

    string s,s1;

    cin>>t;

    while(t--)

    {

        cin>>n>>s;

        s1=s;

        sort(s.begin(),s.end());

        for(i=0;i<n/2;i++)

        {

            l=i,r=n-i-1;

            if(s1[l]>s1[r])

            swap(s1[l],s1[r]);

        }

        if(s1==s)

            cout<<"YES"<<endl;

        else

            cout<<"NO"<<endl;

    }

    return 0;

}