zbaharav@kehillah.org 30-nestedloops > repeatMe
prev  |  next  |  chance

Given a String and and an integer n, return a string with the first letter appearing n times, the second repeating n-1 times, and so on, but make sure each character appears at least once. (Credit to Abby) repeatMe("dog", 4) → "ddddooogg" repeatMe("Tower", 3) → "TTToower" repeatMe("Yay", 6) → "YYYYYYaaaaayyyy" Go...Save, Compile, Run (ctrl-enter) public String repeatMe(String str, int n) { } 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: 100

Copyright Nick Parlante 2017 - privacy