Very simple python 🐍 solution O(N) time and space
\nclass Solution:\n    def breakPalindrome(self, palindrome: str) -> str:\n         \n        \n        for i in range(len(palindrome)//2):\n                if 
```\nclass Solution:\n    def breakPalindrome(self, palindrome: str) -> str:\n         \n        \n        for i in range(len(palindrome)//2):\n                if palindrome[i]!=\'a\':\n                    return palindrome[:i]+\'a\'+palindrome[i+1:]\n                        \n        return palindrome[:-1]+\'b\' if len(palindrome)>1 else ""\n        \n        \n```
['Python', 'Python3']