simple solution|| using two pointers
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def makeSmallestPalindrome(self, s: str) -> str:
        l=0
        r=len(s)-1
        res=[i for i in s]

        while l<r:
            if ord(s[l])<ord(s[r]):
                res[l]=s[l]
                res[r]=s[l]
            elif ord(s[l])>ord(s[r]):
                res[l]=s[r]
                res[r]=s[r]
            l+=1
            r-=1
        return "".join(res)

    

        
```
['Two Pointers', 'String', 'Python3']