1mg Interview Experience | Set 2
Round 1: Telephonic
- LRU cache implementation
- String pool concept
- Tree related Question ( traversal in level order and some binary search question)
- Next greater element on right side
- Design a data structure which insert, delete and find random number in O(1).
- Hashmap working
- Cookies related stuff( how browser save login information )
- Design database of Restaurant service.
- 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/
- 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/
- maximum and minimum number of binary search tree.
- one was related to mathematics I don’t remember exactly
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon. Google and Microsoft Test Serieses.