DAILY LEETCODE SOLUTION || BREAK A PALINDROME
\nclass Solution {\npublic:\n    string breakPalindrome(string palindrome) {\n        int n=palindrome.size();\n        if(n==1) return "";\n        if(n%2==0)\
```\nclass Solution {\npublic:\n    string breakPalindrome(string palindrome) {\n        int n=palindrome.size();\n        if(n==1) return "";\n        if(n%2==0)\n        {\n            int idx=-1;\n            for(int i=0;i<n;i++)\n            {\n                if(palindrome[i]!=\'a\')\n                {\n                    idx=i;\n                    palindrome[i]=\'a\';\n                    break;\n                }\n            }\n            if(idx==-1)\n            {\n                palindrome[n-1]=\'b\';\n            }\n            return palindrome;\n        }\n        else\n        {\n            int idx=-1;\n            for(int i=0;i<n;i++)\n            {\n                if(palindrome[i]!=\'a\'&&i!=n/2)\n                {\n                    idx=i;\n                    palindrome[idx]=\'a\';\n                    break;\n                }\n            }\n            if(idx==-1)\n            {\n                palindrome[n-1]=\'b\';\n            }\n            return palindrome;\n        }\n    }\n};\n```
['String', 'Greedy', 'C']