logo CodeStepByStep logo

hashString

Language/Type: JavaScript recursion

Write a recursive function named hashString that accepts an integer parameter k and returns a string of # (hash symbols) that is 2k characters long (i.e., 2 to the kth power). For example, the call of hashString(3) returns "########". Throw an exception with the message "n must be non-negative" if k is less than 0. Do not use loops; you must use recursion.

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.