EASIEST JAVA SOLUTION EVER
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```\nclass Solution {\n    public String makeSmallestPalindrome(String s) {\n        char[] arr = s.toCharArray();\n        int n = arr.length;\n\n        for (int i = 0; i < n / 2; i++) {\n            int j = n - i - 1;\n            if (arr[i] != arr[j]) {\n                arr[j] = arr[i] < arr[j] ? arr[i] : arr[j];\n                arr[i] = arr[j];\n            }\n        }\n\n        return new String(arr);\n    }\n}\n```\n`**UPVOTE PLEASE**``\n```
['C++', 'Java']