Easy JavaScript solution
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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\n/**\n * @param {string} s\n * @return {string}\n */\n\nvar makeSmallestPalindrome = function(s) {\n    let count=0;\n    let arr=s.split(\'\')\n    let i=0,len=arr.length-1\n    let reversed=arr.slice().reverse()\n    while(i<=len && arr!=reversed){\n        if(arr[i]==arr[len]){}\n        else if(arr[i].charCodeAt(0)>arr[len].charCodeAt(0)){\n            arr[i]=arr[len]\n            count++\n        }\n        else if(arr[i].charCodeAt(0)<arr[len].charCodeAt(0)){\n            arr[len]=arr[i]\n            count++\n        }i++;len--; }\n    return arr.join(\'\')};\n```
['JavaScript']