Java 100% | Greedy | O(n) | easy
\nclass Solution {\n    public String breakPalindrome(String s) {\n        \n        int l=s.length();\n        if(l==1)\n            return("");\n        \n   
```\nclass Solution {\n    public String breakPalindrome(String s) {\n        \n        int l=s.length();\n        if(l==1)\n            return("");\n        \n        char ch[]=s.toCharArray();\n        for(int i=0;i<ch.length/2;i++)\n        {\n          \n            if(ch[i]!=\'a\')\n            {\n                ch[i]=\'a\';\n                return(String.valueOf(ch));\n            }\n        }\n        \n            ch[l-1]++;\n              return(String.valueOf(ch));\n     \n      \n    }\n}\n```
['Greedy', 'Java']