CodingBat Java Recursion-1 changeXY

about | help | done | prefs | create account

CodingBat code practice

Java > 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
public String changeXY(String str) { }

See also Java Example Code. Java help docs: If Boolean Logic | Strings | While and For Loops | Arrays and Loops

prev | next | chance | CodingBat > Recursion-1

Forget It! -- delete my code for this problem

New just for fun
Random User Progress Graphs
Random Epic Graphs 336.0

id/email
password

	forgot password