Hash Tables: Ransom Note
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.
. Each word consists of English alphabetic letters (i.e., to and to ). The words in the note and magazine are case-sensitive. Output Format
Print Yes if he can use the magazine to create an untraceable replica of his ransom note; otherwise, print No.
6 4 give me one grand today night give one grand today
All four words needed to write an untraceable replica of the ransom note are present in the magazine, so we print Yes as our answer.