http://www.javaproblems.com/2013/11/java-recursion-1-strcount-codingbat.html Webpublic int countHi2 (String str) { return countHi2 (str, 0); } public int countHi2 (String str, int start) { start = str.indexOf ("hi", start); if (start == -1) { return 0; } int count = 0; if (start == 0 str.charAt (start - 1) != 'x') { count++; } return count + countHi2 (str, start + 2); } Share Improve this answer

Java > Recursion-1 > strCopies (CodingBat Solution)

http://www.javaproblems.com/2013/11/java-recursion-1-counthi2-codingbat.html http://www.javaproblems.com/2013/11/java-recursion-1-counthi-codingbat.html bust the net twitter

java - Counting occurrences of "hi" in a string, except where …

WebRecursion-1 chance. Basic recursion problems. Recursion strategy: first test for one or two base cases that are so simple, the answer can be returned immediately. Otherwise, … WebNov 24, 2013 · master codingbat/java/recursion-1/sumDigits.java Go to file mirandaio Added Recursion-1 problems Latest commit 6cff0d4 on Nov 24, 2013 History 1 contributor 9 lines (8 sloc) 207 Bytes Raw Blame /* Given a non-negative int n, return the sum of its digits recursively * (no loops). */ public int sumDigits ( int n) { if ( n == 0) return 0; http://www.javaproblems.com/2013/11/java-recursion-1-endx-codingbat-solution.html bust the window lyrics