||||| Fastest and Easiest Python3 Solution |||||
Python3 Solution\n\n# Code\n\nclass Solution:\n    def smallestString(self, s: str) -> str:\n        dic = {\n            "a": "z",\n            "b": "a",\n    
> Python3 Solution\n\n# Code\n```\nclass Solution:\n    def smallestString(self, s: str) -> str:\n        dic = {\n            "a": "z",\n            "b": "a",\n            "c": "b",\n            "d": "c",\n            "e": "d",\n            "f": "e",\n            "g": "f",\n            "h": "g",\n            "i": "h",\n            "j": "i",\n            "k": "j",\n            "l": "k",\n            "m": "l",\n            "n": "m",\n            "o": "n",\n            "p": "o",\n            "q": "p",\n            "r": "q",\n            "s": "r",\n            "t": "s",\n            "u": "t",\n            "v": "u",\n            "w": "v",\n            "x": "w",\n            "y": "x",\n            "z": "y",\n        }\n\n        l = list(s)\n        index = -1\n        for i in range(len(l)):\n            if dic[l[i]] < l[i]:\n                index = i\n                break\n\n        if index != -1:\n            for i in range(index, len(l)):\n                if l[i] != "a":\n                    l[i] = dic[l[i]]\n                else:\n                    break\n        else:\n            l[-1] = "z"\n\n        return "".join(l)\n\n```
['Hash Table', 'Python3']