✅ Easy-Peasy Solution | Greedy
Intuition- At each index of string take smallest character possible such that remaining character \n                are possible to fill with remaining k value.
***Intuition***- At each index of string take smallest character possible such that remaining character \n                are possible to fill with remaining k value.\n\n\tclass Solution {\n\tpublic:\n\t\tstring getSmallestString(int n, int k) {\n\t\t\tstring ans;\n\t\t\tfor(int i=0;i<n;i++){\n\t\t\t\tfor(int j=0;j<26;j++){\n\t\t\t\t\t int t=k-(j+1);\n\t\t\t\t\t if(t<=26*(n-i-1))\n\t\t\t\t\t {\n\t\t\t\t\t\t ans.push_back(\'a\'+j);\n\t\t\t\t\t\t k=t;\n\t\t\t\t\t\t break;\n\t\t\t\t\t }\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ans;\n\t\t}\n\t};\n\t\nDO \u2B06\uFE0F ***UPVOTE*** IF IT WAS HELPFUL !\t
['Greedy', 'C']