jebbert@volusia.k12.fl.us > multiX1
prev  |  next  |  chance

Write a RECURSIVE method that does the same thing as my program. You will have to figure it out from the test data! Your solution MUST be recursive. multiX1("HaveFun") → "HaveFun-aveFun-veFun-eFun-Fun-un-n-n-un-Fun-eFun-veFun-aveFun-HaveFun" multiX1("but") → "but-ut-t-t-ut-but" multiX1("DoNotGetSidetracked") → "DoNotGetSidetracked-oNotGetSidetracked-NotGetSidetracked-otGetSidetracked-tGetSidetracked-GetSidetracked-etSidetracked-tSidetracked-Sidetracked-idetracked-detracked-etracked-tracked-racked-acked-cked-ked-ed-d-d-ed-ked-cked-acked-racked-tracked-etracked-detracked-idetracked-Sidetracked-tSidetracked-etSidetracked-GetSidetracked-tGetSidetracked-otGetSidetracked-NotGetSidetracked-oNotGetSidetracked-DoNotGetSidetracked" Go...Save, Compile, Run (ctrl-enter) public String multiX1(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: 330

Copyright Nick Parlante 2017 - privacy