Anyone been able to solve challenge in the way described in the book? i.e. write a programme that just finds proper names that are also regular words like “Glen” and “glen”, “Laurel” and “laurel”, etc.
I’ve been able to write a programme that matches strings in the /usr/share/dict/words file with the same string in the /usr/share/dict/propernames file - so I get Aaron and Aaron, as well as Cole and cole, etc. - but I’m stuck on how to make it just look for proper names that are also regular words.