| about | help | code help+videos | done | prefs |
Python > Warmup-2 > string_times
prev | next | chance
| Given a string and a non-negative int n, return a larger string that is n copies of the original string.
string_times('Hi', 2) → 'HiHi' string_times('Hi', 3) → 'HiHiHi' string_times('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