- Given an array and an operation -> foo(index, value), the value can be either 1 or -1, if foo(index, value) is called, it will add ‘value’ to all elements from index till end of the array, find minimum number of operation to make all array elements 0.
- Don’t remember completely, but it was something like finding a deadlock in a BST.
- Design a scalable meeting room booking system.
Managerial round, lot of project and Amazon’s leadership principle related questions.
Bar Raiser: Lot of behavioral and leadership principle questions, then asked a design question, design a load balancer’s algorithm so that it redirects the traffic between three services s1, s2, s3 by 50%, 30% and 20%. further clause added to handle various clients calling to specific services.
Tips for the interview: Good hands on towards problem solving and algorithm, HLD and LLD, prepare well for Amazon’s leadership principles.
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.