1
class Solution {
2
  public String getSmallestString(int n, int k) {
3
    char[] ch = new char[n];
4
    for (int i = 0; i < n; i++) {
5
      ch[i] = 'a';
6
      k--;
7
    }
8
    int currChar = 0;
9
    while (k > 0) {
10
      currChar = Math.min(25, k);
11
      ch[--n] += currChar;
12
      k -= currChar;
13
    }
14
    return String.valueOf(ch);
15
  }
16
}