Skip to content
Related Articles
Get the best out of our app
Open App

Related Articles

1mg Interview Experience | Set 2

Improve Article
Save Article
Like Article
Improve Article
Save Article
Like Article

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.
  2. Given a stream of numbers, generate a random number from the stream.
  3. maximum and minimum number of binary search tree.
  4. one was related to mathematics I don’t remember exactly
My Personal Notes arrow_drop_up
Last Updated : 20 Mar, 2018
Like Article
Save Article
Similar Reads