CodingBat Java Recursion-1 NoX

Home » Codingbat Nox Solution » CodingBat Java Recursion-1 NoX

Maybe your like

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

  • Java
  • Python
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") → ""

Go...Save, Compile, Run (ctrl-enter)public String noX(String str) { }

Go

Editor font size %:75100125150Shorter 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

  • Java Example Solution Code
  • Java String Introduction (video)
  • Java Substring v2 (video)
  • Java String Equals and Loops
  • Java String indexOf and Parsing
  • Java If and Boolean Logic
  • If Boolean Logic Example Solution Code 1 (video)
  • If Boolean Logic Example Solution Code 2 (video)
  • Java For and While Loops
  • Java Arrays and Loops
  • Java Map Introduction
  • Java Map WordCount
  • Java Functional Mapping
  • Java Functional Filtering

Misc Code Practice

  • Code Badges
  • Introduction to Mod (video)
  • MakeBricks problem and solution (video x 2)
  • FizzBuzz the famous code interview question (video)

Difficulty: 342.0

Copyright Nick Parlante 2017 - privacy

Tag » Codingbat Nox Solution