Problem Statement
Lexicographically Modified String Game Problem Description Given a string, Alice wants to make it lexicographically small, while Bob wants to make it lexicographically large. Both players play optimally with Alice starting the game. In each turn, they choose an index in the string and change the character at that index. No index can be chosen again if it has already been chosen once. Return the changed string. Examples Example 1: Input: s = "abc" Output: "bza" Example 2: Input: s = "zzz" Output: "aya"