jnovillo@stuy.edu recursion_2_strings > countHi2
prev  |  next  |  chance

Given a string, compute recursively the number of times lowercase "hi" appears in the string, however do not count "hi" that have an 'x' immedately before them. countHi2("ahixhi") → 1 countHi2("ahibhi") → 2 countHi2("xhixhi") → 0 Go...Save, Compile, Run (ctrl-enter) public int countHi2(String str) { } Go Editor font size %:75100125150 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

• 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
• Java Map Introduction
• Java Map WordCount
• Java Functional Mapping
• Java Functional Filtering

Misc Code Practice

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

Difficulty: 375.0

Copyright Nick Parlante 2017 - privacy