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

 

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

APCS Recursion 1, Problem 15. Given a string and a non-empty substring sub, compute recursively if at least n copies of sub appear in the string somewhere, possibly with overlapping. N will be non-negative.


R115_strCopies("catcowcat", "cat", 2) → true
R115_strCopies("catcowcat", "cow", 2) → false
R115_strCopies("catcowcat", "cow", 1) → true

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

public boolean R115_strCopies(String str, String sub, int n) { }

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