In C++ and not Java:

Implement a spelling checker by using a hash table. Assume that the dictionary comes from two sources: an existing large dictionary and a second file containing a personal dictionary. Output all misspelled words and the line numbers on which they occur. Also, for each misspelled word, list any words in the dictionary that are obtainable by applying any of the following rules:

1. Add one character.

2. Remove one character.

3. Exchange adjacent characters

The dictionary file to be used can be found here: use words.txt from https://github.com/dwyl/english-words.