Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

Amazon Interview Experience

  • Difficulty Level : Hard
  • Last Updated : 01 Jul, 2021

Round 1(Coding Round):

  1. Given a binary tree, where every node points to its parent node and the parent of root is null. You have given two nodes to find the distance between them.
  2. Given a matrix of m*n find the maximum path sum from any node. 

     

e.g
 10 20 30 40
20 50 60 100
So, ans is 
10 + 20 + 50 + 60 +100 = 240

e.g
10 30 50
 0 40 30
20 70 80
So, the maximum path sum is
10 -> 30 -> 40 -> 70 -> 80 = 230
  1. Some behavioural questions were asked.

Round 2(Design Round):

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!

  1. Design flight booking system. 

    They are more focusing on LLD in this round. 

    Some cross-questions were asked like how you are handling concurrency for the same ticket etc?

  2. Some behavioral questions were asked.

Round 3(Design Round):

  1. Design Tinder :). 

    They are more focusing on HLD in this round.

  2. Some behavioral questions were asked.
My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!