Problem
Given a string S, a substring X, and a substring Y, replace all occurrences of X with Y in S using recursion.
Input format
Input
input.txt
- A string S (1 to 100 chars, lowercase only) - A string X (1 to 10 chars, lowercase only) - A string Y (0 to 10 chars, lowercase only)
Output format
Output
output.txt
- The resulting string after all replacements
Example
input
ababcabc ab bc
output
abbcbc
💬 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
ababcabc ab bc
Expected output
abbcbc
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