CodingBat Java Recursion-1 count11

CodingBat code practice

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

Given a string, compute recursively (no loops) the number of "11" substrings in the string. The "11" substrings should not overlap.

count11("11abc11") → 2
count11("abc11x11x11") → 3
count11("111") → 1
...Save, Compile, Run
public int count11(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 369.0