Amazon Interview Experience (On-Campus for Internship 2019)

Amazon visited our campus for internship and full time. I took part in the internship drive and I am sharing my experience here.

Round 1 (Online) :

Everyone who satisfied the required cgpa (probably 7) criteria was allowed to sit for this round . It was mixture of aptitude and coding questions . The main parts were :

  1. Logical Reasoning – Questions based on basic mathematics , relations , paragraph based questions were asked .
  2. Debugging – We were asked to correct the given code / write the output of the given code in preferred language (c++, java etc).
  3. Coding –
    1. Graph based question (BFS) :
      https://www.geeksforgeeks.org/shortest-distance-two-cells-matrix-grid/
    2. Matrix based question : 
      https://www.geeksforgeeks.org/search-in-row-wise-and-column-wise-sorted-matrix/

I could solve both the coding questions in minimum time and space complexity .

Round 2 (Pen and Paper Round) :

We were given two DSA questions and we had to write production ready code from scratch in 30 mins. The questions were:

  1. https://www.geeksforgeeks.org/lowest-common-ancestor-binary-tree-set-1/
  2. https://www.geeksforgeeks.org/print-a-given-matrix-in-spiral-form/

The code had to be syntactically correct and also all edge cases should have been covered . Additionally if you are confident enough do mention the time and space complexities. Small things like proper variable names , edge cases consideration , neat code makes a huge difference .



Round 3 (PI) :

This was the first face to face interview round . The interviewer was friendly and made me feel at ease before starting the interview . First he had a quick look at my cv . I didn’t have any personal project / previous internships / extra technical skills .So I was asked mostly conceptual questions .   

He asked me my preferred programming language . (I said C++). He asked me some questions on object oriented programming aspect like what are the main features of object oriented programming , difference between the access specifiers , where to use what , what are the benefits of oop , inheritance & polymorphism in depth etc . 

He asked me some dbms questions . I was asked to write one or two sql queries mainly based on joins.

Then he shifted to DSA . I was asked about hashing – how it is implemented , types etc . I was also asked to design a hash function of my own . I couldn’t answer this question perfectly . Then I was asked two DSA questions –

  1. LCA : https://www.geeksforgeeks.org/lowest-common-ancestor-binary-tree-set-1/ 

    At first I couldn’t give the space optimized solution . He gave me some hints and ultimately I could give the space optimized solution .
     

  2. https://leetcode.com/problems/k-th-symbol-in-grammar/

    I could give the recursive solution for this but it was not space optimized , so he gave me several hints . I followed them ,even went in the right direction but couldn’t come up with the correct solution . However I shared my thought process throughout the discussion .

This round took about 1 hour . Some of my friends were called for a second PI round .

NOTE  :  It’s better to be fluent in java as most interviewers prefer that . Also it’s not always important to give the correct code. The way we are approaching the question , our thought process matters as well . Therefore think loud.

Verdict : Selected  

I practiced from geeksforgeeks for about 5-6 months . Initially I practiced topic wise , later when I was confident enough I started practicing company wise ( mainly for those companies which visited our campus). Also I made it a habit to read atleast one interview experience from gfg daily .

 


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

My Personal Notes arrow_drop_up

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.