Problem
Given a string S and two characters A and B, replace all occurrences of character A in S with character B using recursion and print the resulting string.
Input format
Input
input.txt
- A string S (length 1 to 50, lowercase letters only) - Two lowercase characters A and B, separated by space
Output format
Output
output.txt
- The resulting string after replacement
Example
input
banana a o
output
bonono
💬 Discussion
Loading...💬
No comments yet. Be the first to start the discussion!
💻 No output yet.
Click Run in the editor to execute your code with the custom input.
Sample cases (from the problem)
Sample Case 1
Input
banana a o
Expected output
bonono
Solve it your way first
Community solutions unlock after you submit a passing solution. Don't peek.
Ready to solve this challenge?
Create a free account to write code, submit solutions, and track your progress.
⌨️ Keyboard Shortcuts
Code Editor
Run Code
Ctrl
Enter
Submit Code
Ctrl
Shift
Enter
Format Code
Shift
Alt
F
Toggle Comment
Ctrl
/
Undo
Ctrl
Z
Redo
Ctrl
Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc