/**
* Time complexity :
* Space complexity :
*/
class Solution {
public String convertToTitle(int n) {
if(n == 0) return "";
char[] alphabets = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H',
'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q',
'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'};
StringBuilder result = new StringBuilder();
while(n > 0) {
n--;
result.append(alphabets[n%26]);
n /= 26;
}
return result.reverse().toString();
}
}
