insidcode
ProblemsDuelLeaderboardStats
Sign In
  1. Home
  2. Problems
  3. Replace all occurrences of a character (say 'a' → 'x') recursively.

Replace all occurrences of a character (say 'a' → 'x') recursively.

Difficulty: Hard

Phase: 3 · Recursion

XP Reward: 30 XP

Topics: Recursion, Hard

Supported Languages: Python, JavaScript, C, C++, Java

Problem Description

Given string S, target char C1, and replacement char C2 on separate lines, replace all C1 with C2 recursively. Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

  • -10^9 <= N <= 10^9

Examples

Example 1

Input: banana a x

Output: bxnxnx

Explanation: Sample execution for input banana a x