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

 

pais@kinetigram.com recursion01 > R110_strCount
prev  |  next  |  chance

APCS Recursion 1, Problem 10. 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.


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

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

public int R110_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: 300

Copyright Nick Parlante 2017 - privacy