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

 

Recursion-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, make a recursive a call for a smaller case (that is, a case which is a step towards the base case). Assume that the recursive call works correctly, and fix up what it returns to make the answer.

 factorial H  bunnyEars H  fibonacci
 bunnyEars2 triangle sumDigits
 count7 count8 powerN
 countX countHi changeXY
 changePi noX array6
 array11 array220 allStar
 pairStar endX countPairs
 countAbc count11 stringClean
 countHi2 parenBit nestParen
 strCount strCopies strDist

Java Help