Skip to content
Related Articles

Related Articles

Improve Article

Amazon Interview experience | Set 335

  • Difficulty Level : Hard
  • Last Updated : 09 Jul, 2019

First Round :

  1. 10 Mins – Introduction of the team , myself , Behavioral questions .
  2. Next 45 mins – write a findMatch method for online game where two players are set to play game.
    If player X comes online then he needs to be matched with player whose existing rank is closest possible to that of Player X. This had to be efficient algorithm and scale to millions of users

Second Round :

  1. Given different time periods during which tasks were running find the time at which maximum tasks are running.

Third Round :

  1. Given a String find out if it contains ONLY all strings from another string.
    Input : str  - FeeO & another String - { "Fe", "e", "O"} 
    Hint : Use DFS to solve this

Fourth Round:

  1. Design Amazon address manager app

Fifth round:

  1. Behavioral questions only.

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

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, AmazonGoogle and Microsoft Test Serieses.

My Personal Notes arrow_drop_up
Recommended Articles
Page :