Simple JAVA Solution for beginners. 9ms. Beats 94.80%.
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 i = 0;\n        int j = arr.length - 1;\n        while (i < j) {\n            if (arr[i] < arr[j]) {\n                arr[j--] = arr[i++];\n            } else {\n                arr[i++] = arr[j--];\n            }\n        }\n    return new String(arr);\n    }\n}\n```
['Two Pointers', 'String', 'Java']