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


Recursion-1 > changeXY
prev  |  next  |  chance

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"

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

public String changeXY(String 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

Java Help

Misc Code Practice

Difficulty: 336.0

Copyright Nick Parlante 2017 - privacy