[Java] Intuitive solution.
The idea is to initialize char array with all value with \'a\'  then to reach k we\'ll increase array elements to max from the end to the beginning.\n\n\t\tchar
The idea is to initialize char array with all value with \'a\'  then to reach k we\'ll increase array elements to max from the end to the beginning.\n```\n\t\tchar[] result = new char[n];\n        for (int i = 0; i < n; i++) {\n            result[i] = \'a\';//initialize all array element with \'a\'\n            k--;\n        }\n        int numValue;\n        while (k > 0) {\n            numValue = Math.min(25, k);//building the string from the end to the beginning, it will always be optimal.\n            result[--n] += numValue;\n            k -= numValue;\n        }\n        return String.valueOf(result);\n```
['Java']