1mg Interview Experience | Set 2

Round 1:  Telephonic

  1. LRU  cache implementation
  2. String pool concept
  3. Tree related Question ( traversal in level order and some binary search question)

Round 2:

  1. Next greater element on right side
  2. Design a data structure which insert, delete and find random number in O(1).
  3. Hashmap working
  4. Cookies related stuff( how browser save login information )
  5. Design database of Restaurant service.

Round 3:

  1. Given a array of size having number in range of n find duplicate in O(n) time and O(1) extra space and array should not be lost.  https://www.geeksforgeeks.org/find-duplicates-in-on-time-and-constant-extra-space/
  2. Given a stream of numbers, generate a random number from the stream. https://www.geeksforgeeks.org/select-a-random-number-from-stream-with-o1-space/
  3. maximum and minimum number of binary search tree.
  4. one was related to mathematics I don’t remember exactly


Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.




Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.