JAva || String fastest Solution || 0ms
\nclass Solution {\n    public String breakPalindrome(String palindrome) {\n        // Code here\n        if(palindrome.length() == 1)\n            return "";\n
```\nclass Solution {\n    public String breakPalindrome(String palindrome) {\n        // Code here\n        if(palindrome.length() == 1)\n            return "";\n        \n        char[] ch = palindrome.toCharArray(); \n        \n        for(int i = 0; i < palindrome.length()/2; i++)\n        {\n            if(ch[i] != \'a\')\n            {\n                ch[i] = \'a\';\n                break;\n            }\n            else if(i == palindrome.length()/2 - 1 && ch[i] == \'a\')\n                ch[ch.length -1] = \'b\';\n        }\n        \n        return new String(ch);\n    }\n}\n```
['String', 'Java']