logo CodeStepByStep logo

Main Page → Exercises → JavaScript → Solve an Exercise

repeatString

Language/Type: JavaScript recursion

Write a recursive function named repeatString that accepts a string and an integer n as parameters and that returns the string concatenated n times. For example, the call of repeatString("hello", 3) returns "hellohellohello". Your function should throw an exception with the message, "n must be non-negative", if passed any negative value for n.

Constraints:

  • Do not declare any global variables.
  • Do not use any arrays to solve this problem.
  • Do not use any loops; you must use recursion.
  • You are allowed to define other "helper" functions if you like; they are subject to these same constraints.

Function: Write a JavaScript function as described, not a complete program.

You must log in before you can solve this problem.

Log In

Need help?

Stuck on an exercise? Contact your TA or instructor.

If something seems wrong with our site, please

Is there a problem? Contact us.