Problem
Given a string S containing only digits (1 ≤ |S| ≤ 12), print all possible valid IP addresses that can be obtained by inserting three dots, using recursion. Each part must be 0-255, no leading zeros (except "0").
Input format
Input
input.txt
- A single string S
Output format
Output
output.txt
- All valid IP addresses, one per line (order does not matter)
Example
input
25525511135
output
255.255.11.135 255.255.111.35
💬 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
25525511135
Expected output
255.255.11.135 255.255.111.35
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