Cyclic Shift Gym - 101972K

 https://vjudge.net/problem/Gym-101972K

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e5+9;
const int mod=1e9+7;

char tmp[maxn];
bool vis[maxn];
int main()
{
    FAST_IO;

    //freopen("input.txt","r",stdin);

    int T;
    cin>>T;
    while(T--)
    {
        int n;
        cin>>n;
        string s,t;
        cin>>s>>t;
        for(int i=0;i<n;i++) vis[i]=0;
        int cnt=0;
        for(int i=0;i<n;i++)
        {
            if(s[i]!=t[i])
            {
                vis[i]=1;
                tmp[cnt++]=t[i];
            }
        }
        char c=tmp[cnt-1];
        for(int i=cnt-1;i>=1;i--)
        {
            tmp[i]=tmp[i-1];
        }
        tmp[0]=c;

        bool f=1;
        cnt=0;
        for(int i=0;i<n;i++)
        {
            if(vis[i])
            {
                if(tmp[cnt++]!=s[i])
                {
                    f=0;
                    break;
                }
            }
        }
        if(f) puts("YES");
        else puts("NO");
    }



    return 0;
}