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


Recursion-1 > strDist
prev  |  next  |  chance

Given a string and a non-empty substring sub, compute recursively the largest substring which starts and ends with sub and return its length.

strDist("catcowcat", "cat") → 9
strDist("catcowcat", "cow") → 3
strDist("cccatcowcatxx", "cat") → 9

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

public int strDist(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: 390.0

Copyright Nick Parlante 2017 - privacy