Interview Question

Mobile Developer Interview San Francisco, CA

You are given a list of about half a million English words

  . All of the English words have fewer than 35 characters. You are also given a (potentially very long) input string of characters. Determine an algorithm that will find all of the valid anagrams of the input string. What data structures will you use? Is it efficient? Now that you've figured out the algorithm, implement it in the language of your choice. How would you parallelize it?

Add Answers or Comments

To comment on this Review, Sign In with Facebook or Sign Up