Smallest Palindromic Rearrangement I
You are given a palindromic string s.
Return the lexicographically smallest palindromic permutation of s.
Example 1
Input
s = "z"Output
"z"A string of only one character is already the lexicographically smallest palindrome.
Example 2
Input
s = "babab"Output
"abbba"Rearranging
"babab" to "abbba" gives the smallest lexicographic palindrome.Constraints
- 1 <= s.length <= 10^5
- s consists of lowercase English letters.
- s is guaranteed to be palindromic.