Codeforces Round #724 (Div. 2) B. Prinzessin der Verurteilung
#include<bits/stdc++.h>
using namespace std;
template <typename T> void debug(string s, T x) { cout << s << "=" << x << "\n"; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll>pll;
typedef pair<int, int>pii;
const ll N = 2e5 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 0x7fffffff;
//因为n的数据范围只有1000
//所以最多只需三个字母的拼接(26^3种情况)就可以满足相异于任何子字符串
//所有情况打表
const int tot = 26*26*26+26*26+26+5;
string ss[tot];
void solve(){
int cnt=0;
for(char i='a';i<='z';i++)ss[cnt++]=i;
for(char i='a';i<='z';i++){
for(char j='a';j<='z';j++){
string s;
s.push_back(i);
s.push_back(j);
ss[cnt++]=s;
}
}
for(char i='a';i<='z';i++){
for(char j='a';j<='z';j++){
for(char k='a';k<='z';k++){
string s;
s.push_back(i);
s.push_back(j);
s.push_back(k);
ss[cnt++]=s;
}
}
}
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
solve();//打表
int t;
cin>>t;
while(t--){
int n;
cin>>n;
string s;
cin>>s;
for(auto i: ss){
if(s.find(i)==string::npos){//find()函数的时间复杂度为O(nm)
cout<<i<<"\n";
break;
}
}
}
return 0;
}