Palindromic Algorithms

Problem Statement

Palindromic Algorithms Problem Description A palindrome reads the same from either direction, e.g., 'ada'. Given a string of lowercase English letters, determine how to change the fewest letters possible to form a palindrome after rearranging the string. If multiple palindromes are possible with the same number of changes, return the alphabetically smallest one. Complete the function makeAlphabeticallySmallestPalindrome in the editor with the following parameter: string s : the string The function is expected to return a STRING . Returns: string : the alphabetically smallest palindromic string that can be obtained by changing a minimum number of characters. Examples Example 1: Input: s = "azzzbbb" Output: "abzbzba" Explanation: The input string "azzzbbb" has character counts: 'a':1, 'b':3, 'z':3. Its length is 7 (odd). For an odd-length palindrome, exactly one character must have an odd count. Here, 'a', 'b', and 'z' all have odd counts. We need to make (3-1)/2 = 1 change to satisfy th