Briefly explained C++ Solution || Detailed
Intuition\nDont get in n instead just declare the string of size n and reverse fill it .\n# Approach\nHelloo ! \nI will break this question in two simple parts 
# Intuition\nDont get in n instead just declare the string of size n and reverse fill it .\n# Approach\nHelloo ! \nI will break this question in two simple parts and I hope it will make the question more easier.\n\nFirst **tackle n**\ndeclare a string of size n with all a\'s;\nDONE!\n\nNow **tackle k**\nWe know for any value of k <= 26 we have an alphabet right??\nSo loop it with this condition just insert z and substract 27?\n27=z+a(which was present earlier)...\n\nAs the k reaches down the 26 just insert the charecter of that value!\n\n**HAPPY CODING UPVOTE IF HELPED !!!**\n\n\n\n\n\n# Code\n```\nclass Solution {\npublic:\n    string getSmallestString(int n, int k) {\n        int index=1;\n        string s(n,\'a\');\n         k-=n;\n         int i;\n         for( i=s.size()-1;i>=0 && k>=26;i--){\n             s[i]=\'z\';\n             k+=1;\n             k-=26;\n         }\n         s[i]=char(97+k);\n          return s;\n    }\n};\n```
['C++']