✅[Python] Only 2 Lines Solution || O(1) || Greedy
\nclass Solution:\n    def getSmallestString(self, n: int, k: int) -> str:\n        z, alp = divmod(k-n-1, 25)\n        return (n-z-1)*\'a\'+chr(ord(\'a\')+alp+
```\nclass Solution:\n    def getSmallestString(self, n: int, k: int) -> str:\n        z, alp = divmod(k-n-1, 25)\n        return (n-z-1)*\'a\'+chr(ord(\'a\')+alp+1)+z*\'z\'\n```
['Greedy', 'Python']