3517. Smallest Palindromic Rearrangement I

LeetCodeStringSortingCounting SortOpen on judge ↗

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. Examp

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI