Skip to content

Practice Restore IP Addresses

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#93
LeetCode Problem

Restore IP Addresses

StringBacktracking

Problem Statement

A valid IP address consists of exactly four integers separated by single dots. Each integer is between 0 and 255 (inclusive) and cannot have leading zeros. Given a string s containing only digits, return all possible valid IP addresses that can be formed by inserting dots into s. You are not allowed to reorder or remove any digits in s. You may return the valid IP addresses in any order.

Source: Restore IP Addresses on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "25525511135"
Output
["255.255.11.135","255.255.111.35"]

# Example 2

Input
s = "0000"
Output
["0.0.0.0"]

# Example 3

Input
s = "101023"
Output
["1.0.10.23","1.0.102.3","10.1.0.23","10.10.2.3","101.0.2.3"]

Constraints

1 <= s.length <= 20
s consists of digits only.

Related LeetCode Problems

Practice more problems similar to Restore IP Addresses.

17 Letter Combinations of a Phone Number Medium22 Generate Parentheses Medium3 Longest Substring Without Repeating Characters Medium5 Longest Palindromic Substring Medium6 Zigzag Conversion Medium
← Previous Reverse Linked List IINext → Binary Tree Inorder Traversal

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free