Take min || Very simple and easy to understand solution
 Up vote if this solution helps\n# Approach\nTake two iterator one from front and one from back.\nThen take the min of s(front) & s(back) and set both s(front) 
<b> Up vote if this solution helps</b>\n# Approach\nTake two iterator one from front and one from back.\nThen take the min of s(front) & s(back) and set both s(front) and s(back) to the min value.\n \n# Code\n```\n    string makeSmallestPalindrome(string s) {\n        int front = 0, back = s.size()-1;\n        while(front <= s.size()/2){\n            s[front] = min(s[front], s[back]);\n            s[back] = s[front];\n            front++; back--;\n        }\n        return s;\n    }\n```\n\n<b>Here is an article of my last interview experience - A Journey to FAANG Company, I recomand you to go through this to know which all resources I have used & how I cracked interview at Amazon:\nhttps://leetcode.com/discuss/interview-experience/3171859/Journey-to-a-FAANG-Company-Amazon-or-SDE2-(L5)-or-Bangalore-or-Oct-2022-Accepted
['C++']