Leetcode 3517. Smallest Palindromic Rearrangement I

Given a palindromic lowercase string s, return the lexicographically smallest palindromic permutation of its letters. This reduces to counting character frequencies and greedily constructing the smallest possible first half (with a middle char if any odd count) and mirroring it.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3517. Smallest Palindromic Rearrangement I

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact