Skip to content
Related Articles

Related Articles

Improve Article
Amazon Interview Experience
  • Difficulty Level : Hard
  • Last Updated : 02 Jun, 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 = 1
    0 -> 30 -> 40 -> 70 -> 80 = 230
  3. Some behavioural questions were asked.

Round 2(Design Round):

  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.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.

My Personal Notes arrow_drop_up
Recommended Articles
Page :