Problem

You have two files - names.txt and characters.txt.

The characters.txt file contains all the characters needed to spell two names from the names.txt file.

When the correct names are found:

• Every character from characters.txt will be used exactly once
• There will be no unused characters