725. Remove All Occurrences of a Character Recursively

Given a string s and a single character ch, return a new string that is s with every occurrence of ch removed. You must implement the removal recursively. The output string is returned wrapped in double quotes in the test format.

Input: A string s and a single-character string ch, formatted as "s", "c".

Output: Return the resulting string wrapped in double quotes.

Examples

Input: "hello", "l"
Output: "heo"
Explanation: Both 'l' characters are removed.

Input: "banana", "a"
Output: "bnn"
Explanation: All three 'a' characters removed.

Input: "abc", "z"
Output: "abc"
Explanation: 'z' does not appear; string is unchanged.

Constraints

• 0 <= s.length <= 10^4
• ch is a single printable ASCII character

Asked by