Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

1mg Interview Experience | Set 2

  • Last Updated : 20 Mar, 2018

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:

Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!

Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!

  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
My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!