Amazon Interview Experience | Set 258 (For SDE1)

Round 3:
Only one question was asked :
1. Convert a BST to sorted doubly linked list without any extra space. (only ptrs to nodes should be created ,no new node creation is allowed.)

Round 4:
Telephonic Round:
1. Tell me about yourself
2. Print the boundary of a tree.
3. There are billions of URL given. Come up with a efficient data structure that returns ip address of these urls.
4. Trie data structure

I was asked to send the code snapshot within five mins after ending the call.

Round 5:
1. Tell me about yourself
2. Projects and Internship
3. Given a tree where each node has an additional ptr called “next” ptr. Initially this next ptr of every node is null. Write code such that each node’s next ptr should point to its next bfs node.
4. Trending tab related question: Given a large stream of strings, return the top 10 most frequently occurring string . (Hash map + min heap of size 10 is the solution.)

Round 6:
1. Tell me about yourself
2. Why do u like Database Mgt System (I had DB in my areas of interest)
3. Design the backend of a social networking application (Eg : linked in)
4. All OS related qns
5. Network qns
6. Oops concepts with real time examples.
7. General technical questions.

All Practice Problems for Amazon !

Contact Us