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


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 (ctrl-enter)

public int count11(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: 369.0

Copyright Nick Parlante 2017 - privacy