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


Recursion-1 > noX
prev  |  next  |  chance

Given a string, compute recursively a new string where all the 'x' chars have been removed.

noX("xaxb") → "ab"
noX("abc") → "abc"
noX("xx") → ""

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

public String noX(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: 342.0

Copyright Nick Parlante 2017 - privacy