Today's excersice was Restore IP Addresses.
I initially wondered if there was a method to identify possible solutions by the length of the string. This did not work out since the ways in which the string was split up would still be a problem.
I realised that the solution would be to split it similar to how I would split it manually. Consider the first character, perform the same function on the rest. If all 4 segments of the ip address was valid, the answer was added to the finals list.
To convert this idea to code, I used backtracking to keep track of the current segments and the index at which the string was being split at.
I initially wondered if there was a method to identify possible solutions by the length of the string. This did not work out since the ways in which the string was split up would still be a problem.
I realised that the solution would be to split it similar to how I would split it manually. Consider the first character, perform the same function on the rest. If all 4 segments of the ip address was valid, the answer was added to the finals list.
To convert this idea to code, I used backtracking to keep track of the current segments and the index at which the string was being split at.
