JavaBat Recursion-1 endX

about | help | done | prefs | create account

JavaBat java practice problems

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"
...Save, Compile, Run
public String endX(String str) { }

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

prev | next | chance | JavaBat > Recursion-1

Forget It! -- delete my code for this problem 360.0

id/email
password

	forgot password