Easy to understand solution in Java. Beats 84.11 %
Complexity

Time complexity:
O(n)


Space complexity:
O(n)

Code
# Complexity
- Time complexity:
O(n)

- Space complexity:
O(n)

# Code
```java []
class Solution {
    public String makeSmallestPalindrome(String s) {
        char[] chars = s.toCharArray();
        int left = 0;
        int right = chars.length - 1;
        while (left < right) {
            if (chars[left] < chars[right]) {
                chars[right] = chars[left];
                left++;
                right--;
            } else {
                chars[left] = chars[right];
                left++;
                right--;
            }
        }
        return new String(chars);
    }
}
```
['Two Pointers', 'String', 'Java']