mediumCounting SortSortingString 0 views
Smallest Palindromic Rearrangement I
You are given a palindromic string s.
You are given a palindromic string s.
Return the lexicographically smallest palindromic permutation of s.
Example 1
Input: s = "z"
Output: "z"
Explanation: A string of only one character is already the lexicographically smallest palindrome.
Example 2
Input: s = "babab"
Output: "abbba"
Explanation: Rearranging "babab" → "abbba" gives the smallest lexicographic palindrome.
Example 3
Input: s = "daccad"
Output: "acddca"
Explanation: Rearranging "daccad" → "acddca" gives the smallest lexicographic palindrome.
Constraints
- 1 <= s.length <= 10^5
- s consists of lowercase English letters.
- s is guaranteed to be palindromic.
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.