| about | help | code help+videos | done | prefs |
Java > Warmup-2 > stringTimes
prev | next | chance
| Given a string and a non-negative int n, return a larger string that is n copies of the original string.
stringTimes("Hi", 2) → "HiHi" stringTimes("Hi", 3) → "HiHiHi" stringTimes("Hi", 1) → "Hi" ...Save, Compile, Run prev | next | chance | CodingBat > Warmup-2 |
Progress graphs, just for fun:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
203.0
Copyright Nick Parlante 2006-11 - privacy