Hash Tables: Ransom Note
Problem Statement :
Harold is a kidnapper who wrote a ransom note, but now he is worried it will be traced back to him through his handwriting. 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 only whole words available in the magazine. 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.
For example, the note is "Attack at dawn". The magazine contains only "attack at dawn". The magazine has all the right words, but there's a case mismatch. The answer is No.
Function Description
Complete the checkMagazine function in the editor below. It must print Yes if the note can be formed using the magazine, or No
Input Format
The first line contains two space-separated integers m, and n , the numbers of words in the and the magazine and the note.
The second line contains m space-separated strings, each magazine[i].
The third line contains n space-separated strings, each note[i].
Constraints
1 <= m, n <= 300
1 <= | magazine[i] | , | note[i] | <= 5
.
Each word consists of English alphabetic letters (i.e, a to z and A to Z).
.Output Format
Print Yes if he can use the magazine to create an untraceable replica of his ransom note. Otherwise, print No.
checkMagazine has the following parameters:
magazine: an array of strings, each a word in the magazine
note: an array of strings, each a word in the ransom note
.
Solution :
Solution in C :
In C :
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#define DICT_SIZE 50007
typedef struct _dict_entry
{
uint64_t hash;
char *str;
int value;
} *dict_entry;
dict_entry dict[DICT_SIZE];
uint64_t get_hash(char *s)
{
int shift = 0;
uint64_t hash = 0;
while (*s != '\0')
{
hash |= *s << shift;
shift += 7;
++s;
}
return hash;
}
dict_entry dict_get(char *s)
{
uint64_t hash = get_hash(s);
size_t pos = hash % DICT_SIZE;
while (dict[pos] != NULL && dict[pos]->hash != hash)
pos = (pos + 1) % DICT_SIZE;
return dict[pos];
}
void dict_inc(char *s)
{
dict_entry entry = dict_get(s);
if (entry)
{
entry->value += 1;
}
else
{
entry = (dict_entry)malloc(sizeof(struct _dict_entry));
memset(entry, 0, sizeof(struct _dict_entry));
entry->hash = get_hash(s);
entry->str = strdup(s);
entry->value = 1;
size_t pos = entry->hash % DICT_SIZE;
while (dict[pos] != NULL)
pos = (pos + 1) % DICT_SIZE;
dict[pos] = entry;
}
}
int is_doable()
{
for (int j = 0; j < DICT_SIZE; ++j)
if (dict[j] && dict[j]->value < 0)
return 0;
return 1;
}
int solve(int n)
{
char buffer[10];
for (int j = 0; j < n; ++j)
{
scanf("%s", buffer);
dict_entry entry = dict_get(buffer);
if (entry == NULL)
return 0; // unbek. wort
entry->value--;
}
return is_doable();
}
int main()
{
#ifdef _DEBUG
char FNAME[250];
strcpy(FNAME, __FILE__);
strcpy(strchr(FNAME, '.'), ".txt");
freopen(FNAME, "rt", stdin);
#endif
int m, n;
scanf("%d %d", &m, &n);
char buffer[10];
for (int j = 0; j < m; ++j)
{
scanf("%s", buffer);
dict_inc(buffer);
}
printf(solve(n) ? "Yes" : "No");
}
Solution in C++ :
In C++ :
#include <string>
#include <iostream>
#include <unordered_set>
using namespace std;
unordered_multiset<string> magazine, ransom;
int main()
{
size_t N, M;
cin >> N >> M;
if(N < M)
{
cout << "No";
return 0;
}
string str;
for(size_t i = 0; i < N; ++i)
{
cin >> str;
magazine.insert(str);
}
for(size_t i = 0; i < M; ++i)
{
cin >> str;
ransom.insert(str);
}
for(const auto& word : ransom)
{
auto found = magazine.find(word);
if(found == magazine.end())
{
cout << "No";
return 0;
}
magazine.erase(found);
}
cout << "Yes";
}
Solution in Java :
In java :
import java.util.*;
public class Solution {
Map<String, Integer> magazineMap;
Map<String, Integer> noteMap;
public Solution(String magazine, String note) {
this.noteMap = new HashMap<String, Integer>();
this.magazineMap = new HashMap<String, Integer>();
Integer occurrences;
for(String s : magazine.split("[^a-zA-Z]+")) {
occurrences = magazineMap.get(s);
if(occurrences == null) {
magazineMap.put(s, 1);
}
else {
magazineMap.put(s, occurrences + 1);
}
}
for(String s : note.split("[^a-zA-Z]+")) {
occurrences = noteMap.get(s);
if(occurrences == null) {
noteMap.put(s, 1);
}
else {
noteMap.put(s, occurrences + 1);
}
}
}
public void solve() {
boolean canReplicate = true;
for(String s : noteMap.keySet()) {
if(!magazineMap.containsKey(s) || (magazineMap.get(s) < noteMap.get(s)) ) {
canReplicate = false;
break;
}
}
System.out.println( (canReplicate) ? "Yes" : "No" );
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int m = scanner.nextInt();
// Eat whitespace to beginning of next line
scanner.nextLine();
Solution s = new Solution(scanner.nextLine(), scanner.nextLine());
scanner.close();
s.solve();
}
}
Solution in Python :
In Python3 :
def ransom_note(magazine, ransom):
rc = {} # dict of word: count of that word in the note
for word in ransom:
if word not in rc:
rc[word] = 0
rc[word] += 1
for word in magazine:
if word in rc:
rc[word] -= 1
if rc[word] == 0:
del rc[word]
if not rc:
return True
return False
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")
View More Similar Problems
Game of Two Stacks
Alexa has two stacks of non-negative integers, stack A = [a0, a1, . . . , an-1 ] and stack B = [b0, b1, . . . , b m-1] where index 0 denotes the top of the stack. Alexa challenges Nick to play the following game: In each move, Nick can remove one integer from the top of either stack A or stack B. Nick keeps a running sum of the integers he removes from the two stacks. Nick is disqualified f
View Solution →Largest Rectangle
Skyline Real Estate Developers is planning to demolish a number of old, unoccupied buildings and construct a shopping mall in their place. Your task is to find the largest solid area in which the mall can be constructed. There are a number of buildings in a certain two-dimensional landscape. Each building has a height, given by . If you join adjacent buildings, they will form a solid rectangle
View Solution →Simple Text Editor
In this challenge, you must implement a simple text editor. Initially, your editor contains an empty string, S. You must perform Q operations of the following 4 types: 1. append(W) - Append W string to the end of S. 2 . delete( k ) - Delete the last k characters of S. 3 .print( k ) - Print the kth character of S. 4 . undo( ) - Undo the last (not previously undone) operation of type 1 or 2,
View Solution →Poisonous Plants
There are a number of plants in a garden. Each of the plants has been treated with some amount of pesticide. After each day, if any plant has more pesticide than the plant on its left, being weaker than the left one, it dies. You are given the initial values of the pesticide in each of the plants. Determine the number of days after which no plant dies, i.e. the time after which there is no plan
View Solution →AND xor OR
Given an array of distinct elements. Let and be the smallest and the next smallest element in the interval where . . where , are the bitwise operators , and respectively. Your task is to find the maximum possible value of . Input Format First line contains integer N. Second line contains N integers, representing elements of the array A[] . Output Format Print the value
View Solution →Waiter
You are a waiter at a party. There is a pile of numbered plates. Create an empty answers array. At each iteration, i, remove each plate from the top of the stack in order. Determine if the number on the plate is evenly divisible ith the prime number. If it is, stack it in pile Bi. Otherwise, stack it in stack Ai. Store the values Bi in from top to bottom in answers. In the next iteration, do the
View Solution →