id/email | |

password | |

forgot password | |

create account | |

Or use Mozilla Persona: | |

Nick's post on Why Persona is Great |

about | help | code help+videos | done | prefs |

**Java** > Recursion-1 > count8

prev | next | chance

Given a non-negative int n, compute recursively (no loops) the count of the occurrences of 8 as a digit, except that an 8 with another 8 immediately to its left counts double, so 8818 yields 4. Note that mod (%) by 10 yields the rightmost digit (126 % 10 is 6), while divide (/) by 10 removes the rightmost digit (126 / 10 is 12).
count8(8) → 1 count8(818) → 2 count8(8818) → 4 ...Save, Compile, Run prev | next | chance | CodingBat > Recursion-1 |

Forget It! -- delete my code for this problem

Progress graphs, just for fun:

Your progress graph for this problem

Random user progress graph for this problem

Random Epic Progress Graph

- Java Example Solution Code
- Java String Introduction (video)
- Java Substring v2 (video)
- Java String Equals and Loops
- Java String indexOf and Parsing
- Java If and Boolean Logic
- If Boolean Logic Example Solution Code 1 (video)
- If Boolean Logic Example Solution Code 2 (video)
- Java For and While Loops
- Java Arrays and Loops

- Code Badges
**new** - Introduction to Mod (video)
- MakeBricks problem and solution (video x 2)
- FizzBuzz the famous code interview question (video)

324.0

Copyright Nick Parlante 2006-11 - privacy