AZ$-$Intern$/$Fresher Palindromic

Algorithms

AlL

A word$-$generating system is currently being

trained on palindromic algorithms. A string that

consists of lowercase English characters is said

to be a patindrome if it reads the same forward

and backward. For example, $"$a$",$ "abbcbba" are

palindromes whereas "hackerrank", "cdec" are

not.

For a given string s$,$ the algorithm can change

any number of characters in the string and

permute the resulting string in any desired

order. The algorithm aims to produce a

palindrome after the fewest possible character

changes, If there are multiple possible

palindromes after the fewest number of

changes, return the lexicographically smallest of

them.

$7$ Note:A string a is lexicographicaily smaller than

another string b of the same length if the first

in a erent letter from the left in a and $b$ is smaller

Example

Pplimalig, the af corithm changes one $\text{'}2\text{'}$ to a$?$

The rerulting string is Jagrabob" This can be