Lexicographically Smallest Palindrome || C++
\n# Code\n\nclass Solution {\npublic:\n    string makeSmallestPalindrome(string s) {\n        int i=0;\n        int j=s.size()-1;\n    \n        while(i<j){\n  
\n# Code\n```\nclass Solution {\npublic:\n    string makeSmallestPalindrome(string s) {\n        int i=0;\n        int j=s.size()-1;\n    \n        while(i<j){\n            if(s[i]!=s[j]){\n                if(int(s[i])>int(s[j]))   s[i]=s[j];\n                else    s[j]=s[i];\n            }\n            i++;\n            j--;\n        }\n        return s;\n    }\n};\n```
['C++']