Amazon Interview | Set 9 (Answers)
This post is about answers to the questions asked in Amazon Interview | Set 9. It contains links to some of the solutions available on the geeksforgeeks. I have also written my answers which I replied in the interview. I hope it would help the readers.
Online Programming Round: (5 methods, 2 hours)
Become a success story instead of just reading about them. Prepare for coding interviews at Amazon and other top product-based companies with our Amazon Test Series. Includes topic-wise practice questions on all important DSA topics along with 10 practice contests of 2 hours each. Designed by industry experts that will surely help you practice and sharpen your programming skills. Wait no more, start your preparation today!
Telephonic Interview 1:
Telephonic Interview 2:
Face-to-face Interview 1: (Hyderabad, Date: November 08, 2012)
2) I gave the following solution (with the help of the interviewer):
1. For every set, find out the number of sets it has intersection with. Also maintain those set indices.
2. Remove the set which has maximum number of intersection. And update the remaining numbers.
3. Repeat step 2 till we have any set which has intersection with any other set. At the end, we will have the solution. (Still not sure about optimality).
We can relate the solution with graphs: Remove some nodes so that remaining all the nodes are isolated nodes.
Searching: To make searching efficient, we can build trie data structure using bits for every set. So that we can find the intersections fasters.
Face-to-face Interview 2 (with a manager):
1) I tried for some time. Then the interviewer gave me the formula. The number is 1+ceil((N-W)/S) in all the cases.
For second part of question, simple solution is to find min in every window. But we can optimize so that we can utilize previous results/previous min.
Bit optimal: I created a min-heap of W elements. But the heap contained indices of the array elements, not the values inside the array itself. The indices were stored in heap as per their values in the array. Then for a new window, search the heap linearly (heap was in form of array), replace the old indices (which are no longer in the new window) with the new indices, and adjust that index in the heap. After adjusting all the new indices, we will have new min for the new window at the root. (Not sure whether the complexity brought in to the solution is worth!)
Face-to-face Interview 3:
2) I gave a solution based on trie data structure using characters of the string. But he suggested to build trie based on the string itself. However, I was not able to think in that way.
3) Linear search. Binary search.
Face-to-face Interview 4 (with the manager of the unit of opening):
2) I said, we can organize an online coding competition. People would register and we will have the details. He replied, it’s too expensive. Then I said, we can postpone the competition!
All the Best!
Thanks to Hitesh for sharing his answers. If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.