HackerRank-Solution-Algorithm-/Spell_Check.cpp at main · amankayat/HackerRank-Solution-Algorithm- · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#include <bits/stdc++.h>
using namespace std;
#define pfi(a) printf("%d",a);
#define pfl(a) printf("%lld",a);
#define pfin(a) printf("%d\n",a);
#define pfln(a) printf("%lld\n",a);
#define pfis(a) printf("%d ",a);
#define pfls(a) printf("%lld ",a);
#define sfi(a) scanf("%d",&a);
#define sfl(a) scanf("%lld",&a);
#define f(i,a,b) for(int i=a;i<b;i++)
#define pb(a) push_back(a)
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fast ios::sync_with_stdio(false);cin.tie(NULL)
#define ll long long
#define lb lower_bound
#define ub upper_bound
#define bp(i) __builtin_popcount(i)
ll mod=1e9+7;


int main()
{


   int t;cin>>t;
   while(t--)
   {
      int n;cin>>n;
      string s;cin>>s;
      map<char,int>ma;
      for(int i=0;i<n;i++)
      {
         ma[s[i]]++;
      }
   if(n==5 && ma['T']==1 && ma['i']==1 && ma['m']==1 && ma['u']==1 && ma['r']==1)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;


   }
}