Amazon

The process includes an automatic interview, followed by a technical interview. Then comes the loop, which is an extremely difficult series of three interviews scheduled for the same day. You should prepare months in advance if you want to have a goo

Round 1: DSA Round The interviewer asked a question on Matrices (find the Kth smallest number in a matrix), which I solved using Binary Search but improvised using Heaps. The interview went on for quite some time; after one question, he asked me som

I was asked two questions on heaps. I was able to solve one and optimize it. For the next one, I solved the brute force but could not do the optimization. 1. Arrange a string in such a way that no two consecutive characters are the same. 2. Add rope