📌Most easy || C++||✅✅ || Intuitive|| Smallest Solution
Inorder to get the smallest lexographical string, the simple Intuition would be that  we will  convert the first non-\'a\' character to \'a\' which does not hav
* Inorder to get the smallest lexographical string, the simple Intuition would be that  we will  convert the first non-\'a\' character to \'a\' which does not have \'a\' on its palindrome corners (i.e at start and end). so that it both does not become \'a\' this is how we will be able to obtain smallest break palindrome.\n* One of the edge case would what if we have string which contains only \'a\', like \'\'aaaaaa\'\' then we will simply convert the last character of string to \'b\' to make it smallest i.e \'\'aaaaab\'\'.\n\n```\nclass Solution {\npublic:\n    string breakPalindrome(string palindrome) {\n        int l=0; r=n-1;\n        if(palindrome.length()<=1){\n            return "";\n        }\n        \n        while(l<r){\n            if(palindrome[l]!=\'a\' && palindrome[r]!=\'a\'){\n                palindrome[l]=\'a\';\n                return palindrome;\n            }else{\n                l++;\n                r--;\n            }\n        }\n        \n        palindrome[n-1]=\'b\';\n        return palindrome;\n    }\n};\n```
['Two Pointers', 'C']