Amazon Interview Experience (FTE) | On-Campus

Amazon has visited our campus (NITJ) for the role of Software Developer Engineer-I (16th August 2019)

Process: 1 online coding round+ 4 F2F technical interviews.

Online coding round:

It was very easy and there were 20+ MCQs and 2 coding questions-
1.you have a string and you have to replace every character with the character 3 place ahead(like a->d, z ->c, ….)
2.related to array, I don’t remember it but it was very easy to implement.

First technical round:

1. Tell me something about yourself.

2. Tell me something not on your resume.

3. Given an array of integers. If the number a and its negation -a both present in the array then print it.
ex:if {10, 5, 0, 9, -10, 7, -5} is given then print 10, 5.                                     
At first  I told him the linear search approach then binary search approach but, I was using the extra space. So, he told me to reduce it to O(1).I explained my modified approach and coded it.

4. LRU implementation :
  I told him an approach having time complexity of O(size of frame).He was not happy with my approach.
 then I tried to think in a different manner and came to a solution where I used pointers and unordered_map to reduce its complexity to O(1) and finally coded it.

5. Merge k sorted array
 I explained him and wrote Min Heap based solution. He was impressed and then asked me the complexity.

Second technical round:

1. Some SQL queries (related to nested query) and sharding.

2. What is BST and how to check that the given binary tree is BST or not.
 I told him the postorder approach using minimum and maximum range. He then asked me what would happen if the left most node is equal to INT_MIN and right most node is equal to INT_MAX then what will you do !? 

3. Sum of a given range
 I explained him 2 approach and he wanted me to code for both of them. 
a) Segment tree(O(Logn))

https:www.geeksforgeeks.org/segment-tree-set-1-sum-of-given-range/

b) Square root decomposition (O(sqrt(n)))

https:www.geeksforgeeks.org/sqrt-square-root-decomposition-technique-set-1-introduction/

4.Which graph traversal method is better and why.

5. Spiral traversal of a binary tree but the direction of traversal should be-down to up manner and start traversing from bottom right node.         
I used 3 stacks and coded it. After that he asked me to try out some examples.

Third technical round:

1.Tell me something about your hobbies and interest.

2.A matrix m is given. you are standing on the given position m[x][y] and there are k numbers of delivery boys with there position given.If the m[i][j]=0 that means this path is blocked. You can move in 4 directions, now you have to find the nearest delivery guy and return its position.
I told him an approach using Backtracking . He asked me to reduce the complexity then I explained and wrote the program using BFS. He asked me to check my code with some examples.

3.Heavy Light Decomposition
I explained him and wrote the code.
link – https://www.geeksforgeeks.org/heavy-light-decomposition-set-1-introduction/

4.Deadlock necessary conditions with examples.

5.There are 2 processors in a system and each having a process.when the process have 2 threads, it takes 4 ms to complete 4 task. How much time it will take if the process have single thread.
       First, I was confused then he explained me the question again. I told him the answer with the appropriate reason but I was not sure.

6.He said me that this is the first time he is taking interview of an ECE student. And asked me questions on microprocessor and RAM internal architecture.

Fourth technical round:

1.Asked me about my internship project.

2.Why we use RNN and what is the difference between RNN and CNN.

3. Question based on system design. 
I said that it was not in my syllabus because my branch is ECE then he told me to use any data structure.I used hash map and DBMS for storing the data.He asked me to write the code.

4.Given a stream of characters. Print all the characters, not repeated in last 10 ms.   
 I used dequeue of size 10 to implement it. 

5. Implement Round Robin process scheduling
It can easily be done using Queue data structure.

6.Why Amazon?

Result

!!!!!!!!!!!We were said to wait for the result. 
!!!!!!!!!!!finally, 4 CSE students and 1 ECE student (luckily me ; ) ) were selected for SDE profile.

Tips:
They want each and every question to be coded properly on paper. So, do practice.
If you know the solution, tell the brute force and then optimize it.Discuss with the interviewer as much as you can. Stay confident and trust your instincts.

I would like to thanks GeeksforGeeks which was a great help during my preparation for the interview.

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.




Article Tags :
Practice Tags :


5


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