Simple Solution || Easy To Understand
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:O(n)\n\n- Space complexity:O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    string makeSmallestPalindrome(string s) {\n        int n=s.size();\n        for(int i=0 ; i < n/2 ; i++){\n            char a=s[i];\n            char b=s[s.size()-i-1];\n            char mini=min(a,b);\n            s[i]=mini;\n            s[s.size()-i-1]=mini;\n        }\n        return s;\n    }\n};\n```
['C++']