Find the matching letters that two strings share.
Anonymous
used a hashmap to store all the letters from one string and then used a for loop to cylce through the second string and see if any of the letters existed as keys in the hashmap.
Check out your Company Bowl for anonymous work chats.