100% easy solution
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
```cpp []
class Solution {
public:
    string makeSmallestPalindrome(string s) {
        int n=s.size();
        int start=0,end=n-1;
        while(start<end)
        {
            if(s[start]==s[end])
            start++,end--;
            else if(s[start]<s[end])
            {
            s[end]=s[start];
            start++,end--;
            }
            else
        {
            s[start]=s[end];
            start++,end--;
        }
        }
        return s; 
    }
};
```
['C++']