id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

mmiller@cacegypt.org recursion > changeXY
prev  |  next  |  chance

Given a string, compute recursively (no loops) a new string where all the lowercase 'x' characters have been changed to 'y' characters.


changeXY('codex') → 'codey'
changeXY('xojxojx') → 'yojyojy'
changeXY('xxesabxx') → 'yyesabyy'

...Save, Compile, Run (ctrl-enter)

def changeXY( str ):

Editor font size %:
Shorter output


Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Python Help

Difficulty: 333 Post-solution available

Copyright Nick Parlante 2017 - privacy