CodingBat Java Recursion-1 countX

CodingBat code practice

Java > Recursion-1 > countX
prev | next | chance

Given a string, compute recursively (no loops) the number of lowercase 'x' chars in the string.

countX("xxhixx") → 4
countX("xhixhix") → 3
countX("hi") → 0
...Save, Compile, Run
public int countX(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 330.0