🐍 Python | O(n) | Easy Alphabet solution
Python:\n\nclass Solution:\n    def sortString(self, s: str) -> str:\n        result = []\n        chars = \'abcdefghijklmnopqrstuvwxyz\'\n        while s:\n   
**Python:**\n```\nclass Solution:\n    def sortString(self, s: str) -> str:\n        result = []\n        chars = \'abcdefghijklmnopqrstuvwxyz\'\n        while s:\n            for c in chars:\n                if c in s:\n                    result.append(c)\n                    s = s.replace(c,\'\',1)\n                else:\n                    chars = chars.replace(c,\'\')\n            chars = chars[::-1]\n        return \'\'.join(result)\n```\n\n\n**Complexity:**\nTime:   O(n)
['Python']