After submitting my resume, a hiring manager quickly got in contact with me.

She scheduled two interviews:

• One with a manager
• The second with another software engineer

Questions asked were Java-based. The manager interview was mostly focused on the Map interface in the Collections framework and different algorithms that could be implemented using a Map. Other questions were based around simple algorithms to encode and decode a list of strings (merely concatenating the strings was sufficient for encoding, nothing special).

The second interview focused on inheritance and conditional statements.

The questions, although code-based, seemed to lean more towards algorithms versus coding knowledge and ability. That is not to say that some emphasis was not put on good coding practices.

I was almost immediately called by the hiring manager upon completing my second interview, informing me that I was being made an offer.

Assuming a preexisting list of 100 words, how would you efficiently see if a word received from input is an anagram of any of the 100 words?