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

 

amjadm@miamioh.edu project5 > noX
prev  |  next  |  chance

Given a string, compute recursively a new string where all the ‘x’ characters have been removed. For example, if the input is “xaxb”, the output should be “ab”. If the input is “abc”, the output is “abc”. If the input is “xx”, the output is an empty string.


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: 305

Copyright Nick Parlante 2017 - privacy