Code RoomValid ip address reconstruction
MediumPrep Room Coding #1163

Valid ip address reconstruction

CodingAlgorithms & data structuresMid–Senior~25 min

Given a string s of digits, return all possible valid IPv4 addresses that can be formed by inserting three dots into s without reordering or removing any digit. A valid segment is 0-255 with no leading zeros (so '0' is valid but '01' and '00' are not). Return the addresses sorted lexicographically. The length of s is between 0 and 12.

Implement
restore_ip_addresses(s: str) → list[str]
Examples
in["25525511135"]out["255.255.11.135","255.255.111.35"]
What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

0:00 of about 25 min
InputExpectedGot
["25525511135"]["255.255.11.135","255.255.111.35"]not run yetsample