smallest-palindromic-rearrangement-i

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given a palindromic string <code>s</code>.

Return the lexicographically smallest palindromic permutation of <code>s</code>.

&nbsp;
Example 1:

<div class="example-block">
Input: s = &quot;z&quot;

Output: &quot;z&quot;

Explanation:

A string of only one character is already the lexicographically smallest palindrome.
</div>

Example 2:

<div class="example-block">
Input: s = &quot;babab&quot;

Output: &quot;abbba&quot;

Explanation:

Rearranging <code>&quot;babab&quot;</code> &rarr; <code>&quot;abbba&quot;</code> gives the smallest lexicographic palindrome.
</div>

Example 3:

<div class="example-block">
Input: s = &quot;daccad&quot;

Output: &quot;acddca&quot;

Explanation:

Rearranging <code>&quot;daccad&quot;</code> &rarr; <code>&quot;acddca&quot;</code> gives the smallest lexicographic palindrome.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 105</code></li>
	<li><code>s</code> consists of lowercase English letters.</li>
	<li><code>s</code> is guaranteed to be palindromic.</li>
</ul>