SpellChecker

Given 2 texts. Your task is to print all unique words from the second text that are not present in the first text.

Sample tests

Input 1

to be or not to be
6
to study or not to study

Output

study

Implementation details

Self-implemented hash map based on vectors and buckets. Attempt to independently implement a built-in C++ hashmap.