Back Clear
# Your Problem: # Given a string, compute recursively (no loops) a new string where all the # lowercase 'x' chars have been changed to 'y' chars. # # # changeXY("codex") → "codey" # changeXY("xxhixx") → "yyhiyy" # changeXY("xhixhix") → "yhiyhiy" # # Credit for this problem goes to Nick Parlante from CodingBat.com # Do not modify anything outside of the function or the function itself. # CODE START def getChangeXY(str:str) -> str: # CODE END # Press Ctrl+E (Command+E on mac) to test your code