Monday, October 12, 2015

Booking.com Technical Interview Preparation

Questions: 
  • parsing xml using function
http://stackoverflow.com/questions/6325436/algorithm-for-parsing-an-xml 
  • find the smallest common element in two arrays 
https://www.quora.com/How-do-I-find-the-lowest-common-duplicate-in-two-large-integer-arrays-with-minimum-time-complexity 
  • Tokenize a string of words and print the top 10 most frequent terms

  • Given a list of words, group them by anagrams of each other.  
http://stackoverflow.com/questions/18476512/find-common-elements-in-two-unsorted-array 
  • Given 2 arrays find common elements
  • Sort a big file
  • Recommendation process
  • .a. Given an unlimited stream of characters, that can only be read one character at a time, using a specific function (e.g. getChar()), and a list of patterns (e.g. "cat", "dog", "man"), write an algorithm to find all the occurrences of the patterns in the stream.
  • .b. Perform a "test run" of the algorithm in order to assess strong points, weak points and, eventually bugs. 
  • .c. Give an estimate of the temporal complexity of the proposed algorithm (e.g. O(x))  
  • Solve as much as possible at interviewbit.com

No comments:

Post a Comment