Amazon Interview Experience | AmazeWow 2020

Round 1: Online Assessment

The AmazeWow assessment was of 30 questions including 2 coding questions.

  1. https://www.geeksforgeeks.org/counting-inversions
  2. https://www.geeksforgeeks.org/number-of-ways-to-get-a-given-sum-with-n-number-of-m-faced-dices/ 

Other 28 MCQs were based on technical portion including OOPCs, DSA etc.

Round 2: Virtual Interview (Round-1)

The interviewer started with few subjective questions based on DBMS, OS and OOPCs.



Then for data structures he asked type of traversals in trees which later on turned into the  first coding question itself, after that he asked is there anyway to reconstruct the tree using these traversals. He then asked is there any exception to reconstruct tree using only one type of traversal. The answer was BST which was my coding question as- Construct the binary search tree using given preorder traversal.

https://www.geeksforgeeks.org/construct-a-special-tree-from-given-preorder-traversal/

Note: You have to ask about input method and other important details from the interviewer yourself.

The first approach I told was O(nlogn) which he asked to optimize then after few minutes of thinking out loud  and with a small hint I got the O(n) solution and after coding it, tried to dry run it and the question was done.

Then he moved to some basic paradigms of OOPCs , following with the difference between run time polymorphism and compile time polymorphism.

Here is the link https://www.geeksforgeeks.org/polymorphism-in-c/ to the answer.

He asked the next question which was https://www.geeksforgeeks.org/find-k-closest-elements-given-value/ with first O(n) then the optimised one with O(logn+k).

And with this round-1 ended.

 

Write your Interview Experience or mail it to contribute@geeksforgeeks.org

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.


Article Tags :
Practice Tags :


2


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.