logo CodeStepByStep logo

Main Page → Exercises → JavaScript → Solve an Exercise

replaceAll

Language/Type: JavaScript recursion string

Write a recursive function named replaceAll that accepts three parameters: a string s, a from, and a to as parameters, and returns a new string that is the same as s but with any occurrences of from changed to to. For example, the call of replaceAll("crazy raccoons", 'c', 'k') should return "krazy rakkoons" and the call of replaceAll("BANANA", 'A', 'O') should return "BONONO".

Your function is case-sensitive; if the character from is, for example, a lowercase 'f', your function should not replace uppercase 'F' characters. In other words, you should not need to write code to handle case issues in this problem.

Constraints:

  • Do not use any loops; you must use recursion.
  • Do not declare any global variables.
  • Do not call any of the following string member functions: indexOf, contains, replace, split. (The poof this problem is to solve it recursively; do not use a library function to get around recursion.)
  • Do not use any arrays.
  • You can declare as many primitive variables like ints as you like, as well as strings.
  • 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.