I'm trying to solve Codeeval's The Ministry of Truth challenge, and have hit 97.5% - is anyone able to spot where my code is missing the last 2.5%? The percentage indicates that one or more of their test cases is failing.
Here's the question - I've used the original wording because I'm worried if I give my version of the problem then it'll be one that misses that 2.5% edge case:
It's 1984, and you are working as an official at the Ministry of Truth. You have intersected a message subjected to Big Brother's doctrine.
Your task is to delete letters from certain "utterances" in order to replace them with an "utterance" approved by the Ministry.
A "word" is a single sequence of Latin letters, and an "utterance" is a sequence of multiple words and spaces.
To compare two "utterances," you have to replace all blocks of spaces with one space. Utterances are considered to be identical when resulting expressions match.
One line contains two different expressions separated by semicolon ';'. The first expression is the original utterance, and the second one is the utterance you want to get.
If you cannot fulfill the order, print a single line «I cannot fix history». Otherwise, output the original utterance by replacing the letters that must be erased with underscore and by replacing all blocks of white spaces with a single white space.
Sample input lines:
Higher meaning;Hi mean this is impossible;im possible twenty two minutes;two minutes Higher meaning;e
Sample output lines:
Hi____ mean___ I cannot fix history ______ two minutes ____e_ _______
Here's the code so far (Python 3):
import sys import re with open(sys.argv, 'r') as f: for line in f: line = line.strip() if not line: continue original, target = line.split(';') # Replace contiguous spaces with one space original = re.sub(r"\s+", " ", original) # Split target into targets targets = target.split() redacted, current_target, i, not_possible, space_next = '', 0, 0, False, False while i < len(original): if not space_next and current_target is not None and targets and len(targets) > 0 and len(original) >= i+len(targets[current_target]) and original[i:i+len(targets[current_target])] == targets[current_target]: redacted += targets[current_target] i += len(targets[current_target]) if current_target < len(targets)-1: current_target += 1 space_next = True else: current_target = None elif original[i] == ' ': redacted += ' ' space_next = False i += 1 else: redacted += '_' i += 1 print('I cannot fix history' if current_target is not None else redacted)