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

 

Recursion-1 > countAbc
prev  |  next  |  chance

Count recursively the total number of "abc" and "aba" substrings that appear in the given string.


countAbc("abc") → 1
countAbc("abcxxabc") → 2
countAbc("abaxxaba") → 2

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

public int countAbc(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: 366.0

Copyright Nick Parlante 2017 - privacy