Easy Java Solution
Approach\n Describe your approach to solving the problem. \nJust check forward and Backword elements are equal or Not. If Not then change bigger one to smaller 
# Approach\n<!-- Describe your approach to solving the problem. -->\nJust check forward and Backword elements are equal or Not. If Not then change bigger one to smaller one.\n\n# Complexity\n- Time complexity:$$O(n)$$\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 {\n    public String makeSmallestPalindrome(String s) {\n        int n = s.length();\n        char[] str = new char[n];\n        for(int i=0;i<n;i++)\n        {\n            str[i] = s.charAt(i);\n        }\n        for(int i=0;i<n/2;i++)\n        {\n            if(str[i]!=str[n-i-1])\n            {\n                if((str[i]-\'a\')<(str[n-i-1]-\'a\'))\n                {\n                    str[n-i-1] = str[i];\n                }\n                else\n                    str[i] = str[n-i-1];\n            }\n        }\n        String st ="";\n        for(int i=0;i<n;i++)\n            st+=str[i];\n        return st;\n    }\n}\n```
['String', 'Java']