What Happened in my INTERVIEW ??😱😱 || Learning && Suggestions || Love Babbar
422.7 هزار بار بازدید -
4 سال پیش
-
Hi all,This video contains all
Hi all,
This video contains all your queries and doubts regarding what i faced in my Amazon Interview. Some of the question that i remember till now are listed under. You can have a look and get an idea of what is asked inside the Interview room........
Amazon Interview Experience:
First Round:
1. Given a Website , which is receiving a lot of clicks at any instant of time. You have to design a system that can give me:(Complexity required: O(1) time, O(1) Space)
1. No. of clicks in last minute
2. No. of clicks in last hour
3. No. of clicks in last day
Second Round:
1. Given a tree, convert all its leaf nodes to doubly Linked List
2. Write code to add/remove/search a node in the above tree, also maintain the Linked list behavior in it.
3. List the Complexities(insertion/Deletion/Search) of the tree after the above modification
4. Write the code for deletion of node In a BST
5. Complexity of the code , if same linked list behavior is required here too
6. Write code for solving the Snake and Ladder Problem
7. Discuss 3 ways to detect and remove a loop in a linked list
Third Round:
1. Rotten Tomatoes(https://www.geeksforgeeks.org/minimum...)
(2 Different approaches)
2. Long Discussion on Projects
Fourth Round:
1. Celebrity Problem(https://www.geeksforgeeks.org/the-cel...)
(O(N) Solution)
2. Variation of Code Change Problem(https://www.geeksforgeeks.org/coin-ch...)
Disclaimer: The Views presented in this Video are solely mine. I am not representing any Company or organisation. I am only telling my opinions not talking on behalf of any org.
This video contains all your queries and doubts regarding what i faced in my Amazon Interview. Some of the question that i remember till now are listed under. You can have a look and get an idea of what is asked inside the Interview room........
Amazon Interview Experience:
First Round:
1. Given a Website , which is receiving a lot of clicks at any instant of time. You have to design a system that can give me:(Complexity required: O(1) time, O(1) Space)
1. No. of clicks in last minute
2. No. of clicks in last hour
3. No. of clicks in last day
Second Round:
1. Given a tree, convert all its leaf nodes to doubly Linked List
2. Write code to add/remove/search a node in the above tree, also maintain the Linked list behavior in it.
3. List the Complexities(insertion/Deletion/Search) of the tree after the above modification
4. Write the code for deletion of node In a BST
5. Complexity of the code , if same linked list behavior is required here too
6. Write code for solving the Snake and Ladder Problem
7. Discuss 3 ways to detect and remove a loop in a linked list
Third Round:
1. Rotten Tomatoes(https://www.geeksforgeeks.org/minimum...)
(2 Different approaches)
2. Long Discussion on Projects
Fourth Round:
1. Celebrity Problem(https://www.geeksforgeeks.org/the-cel...)
(O(N) Solution)
2. Variation of Code Change Problem(https://www.geeksforgeeks.org/coin-ch...)
Disclaimer: The Views presented in this Video are solely mine. I am not representing any Company or organisation. I am only telling my opinions not talking on behalf of any org.
4 سال پیش
در تاریخ 1398/12/16 منتشر شده
است.
422,731
بـار بازدید شده