I'm solving HackerRank "Ransom Note" challenge. The code runs fine and cracks it, but I have an issue with its performance. It times out in some cases.
A kidnapper wrote a ransom note but is worried it will be traced back to him. He found a magazine and wants to know if he can cut out whole words from it and use them to create an untraceable replica of his ransom note. The words in his note are case-sensitive and he must use whole words available in the magazine, meaning he cannot use substrings or concatenation to create the words he needs.
Given the words in the magazine and the words in the ransom note, print Yes if he can replicate his ransom note exactly using whole words from the magazine; otherwise, print No.
The first line contains two space-separated integers describing the respective values of (the number of words in the magazine) and (the number of words in the ransom note).
The second line contains space-separated strings denoting the words present in the magazine.
The third line contains space-separated strings denoting the words present in the ransom note.
def ransom_note(magazine, ransom): for word in ransom: if word in magazine: magazine.remove(word) else: return False return True m, n = map(int, input().strip().split(' ')) magazine = input().strip().split(' ') ransom = input().strip().split(' ') answer = ransom_note(magazine, ransom) if(answer): print("Yes") else: print("No")
It's timing out when there are too many items (30.000) on
ransom. Performance talking, what can I improve here?