Skip to content
Related Articles

Related Articles

Improve Article

Amazon Interview Experience | AmazeWow 2020

  • Difficulty Level : Medium
  • Last Updated : 29 Jun, 2020

Round 1: Online Assessment

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

Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!

Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsft, TCS, Wipro, Google and many more!

  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.

 

My Personal Notes arrow_drop_up
Recommended Articles
Page :