class Solution {
public:
vector<string>res;
string temp="";
string getHappyString(int n, int k) {
string mp="abc";
backtracking(mp,n,k);
if(k>res.size())
return "";
return res[k-1];
}
void backtracking(string mp,int n,int k)
{
if(res.size()>=k)
return;
if(temp.size()==n)
{
res.push_back(temp);
return;
}
for(int i=0;i<3;i++)
{
if(temp.size()==0)
temp.push_back(mp[i]);
else
{
if(mp[i]!=temp[temp.size()-1])
temp.push_back(mp[i]);
else
continue;
}
backtracking(mp,n,k);
temp.pop_back();
}
}
};