Package g3501_3600.s3517_smallest_palindromic_rearrangement_i

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3517 - Smallest Palindromic Rearrangement I.

    Medium

    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:

    • <code>1 <= s.length <= 10<sup>5</sup></code>

    • s consists of lowercase English letters.

    • s is guaranteed to be palindromic.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final String smallestPalindrome(String s)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait