JAVA | beats 96%
\npublic String getSmallestString(int n, int k) {\n        char[] alphabets = new char[]{\'a\',\'b\',\'c\',\'d\',\'e\',\'f\',\n                                 
```\npublic String getSmallestString(int n, int k) {\n        char[] alphabets = new char[]{\'a\',\'b\',\'c\',\'d\',\'e\',\'f\',\n                                        \'g\',\'h\',\'i\',\'j\',\'k\',\'l\',\n                                        \'m\',\'n\',\'o\',\'p\',\'q\',\'r\',\n                                        \'s\',\'t\',\'u\',\'v\',\'w\',\'x\',\'y\',\'z\'};\n        char[] c = new char[n];\n        Arrays.fill(c , \'a\');\n        \n        int i=n-1;\n        int reqSum = k-n;\n        while(reqSum>0)\n        {\n             if (reqSum <= 25)\n             {\n                 c [i] = alphabets[reqSum];\n                 break;\n             }\n              \n            else\n            {\n                c[i]=\'z\';\n                i--;\n                reqSum-=25;\n            }\n        }\n        \n        return String.valueOf(c);\n    }\n\t```
[]