Applied online at workingatbooking.com. * First round with HR. They are very kind and they ask some general questions. * Second round technical phone interview with two developers using Titanpad. Questions: 1. Write an algorithm in the language you prefer (no pseudocode) to find the 5 top frequent words and their number of occurrences from an input string containing the full Shakespeare text. ex: 293.192 the 240.123 an 214.167 a 190.923 for 293.846 I 2. What if it wasn't the top 5 but the top 1000 most frequent words? 3. Acces time of an HashMap. 4. Why the access time of an HashMap is constant.