Very simple and Easy Solution⚡🔥🔥
\n# Code\n\nclass Solution {\npublic:\n    string makeSmallestPalindrome(string s) {\n        int i=0;\n        int j=s.size()-1;\n        \n        \n        s
\n# Code\n```\nclass Solution {\npublic:\n    string makeSmallestPalindrome(string s) {\n        int i=0;\n        int j=s.size()-1;\n        \n        \n        string ans;\n        while(i<j){\n            if(s[i]!=s[j]){\n                ans+=min(s[i],s[j]);\n            }\n            else{\n                ans+=s[i];\n            }\n            i++;\n            j--;\n        }\n        string q=ans;\n        reverse(q.begin(),q.end());\n        \n        int n=s.size();\n        if(n%2)ans+=s[n/2];\n        ans+=q;\n        return ans;\n        \n        \n    }\n};\n```
['C++']