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


Recursion-1 > strCount
prev  |  next  |  chance

Given a string and a non-empty substring sub, compute recursively the number of times that sub appears in the string, without the sub strings overlapping.

strCount("catcowcat", "cat") → 2
strCount("catcowcat", "cow") → 1
strCount("catcowcat", "dog") → 0

...Save, Compile, Run (ctrl-enter)

public int strCount(String str, String sub) { }

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

Copyright Nick Parlante 2017 - privacy