Problem Statement

Problem Description Two players take turns editing a string: one wants the final result to be as small as possible in lexicographic order, and the other wants it as large as possible. Both play with perfect strategy, and the size-minimizing player moves first. On a turn, a player picks an index of the string that has never been picked before and changes the character sitting there. Once an index has been used, it can never be picked again by either player. Return the string that results once every index has been used. Examples Example 1 Input: s = "abc" Output: "bza" Example 2 Input: s = "zzz" Output: "aya"