Back Clear
# Your Problem: # Given a string, compute recursively a new string where all the lowercase # 'x' chars have been moved to the end of the string. # # # endX("xxre") → "rexx" # endX("xxhixx") → "hixxxx" # endX("xhixhix") → "hihixxx" # # 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 getEndX(str:str) -> str: # CODE END # Press Ctrl+E (Command+E on mac) to test your code