easy and simple solution
\n# Complexity\n- Time complexity:$O(n/2)$\n Add your time complexity here, e.g. O(n) \n\n- Space complexity:$O(1)$\n Add your space complexity here, e.g. O(n) 
\n# Complexity\n- Time complexity:$O(n/2)$\n<!-- Add your time complexity here, e.g. $$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    {\n        int first=0;\n        int last=s.length()-1;\n        while(first<=last)\n        {\n            if(s[first]!=s[last])\n            {\n                char k=min(s[first],s[last]);\n                s[first]=k;\n                s[last]=k;\n            }\n            first++;\n            last--;\n            \n        }\n        return s;\n    }\n};\n```\n# upvote me if you like the solution comment if any doubts\n![images.jpeg](https://assets.leetcode.com/users/images/2996b8fb-ec16-4502-b820-a3705727a230_1684646601.8691707.jpeg)\n
['C++']