Amazon came to our campus a week back and procedure was as follows:
20 easy MCQ
2 coding questions:
(a)- Find next greater number with same set of digits –>even brute force solution is working.
(b)-Evaluation of post fix expression.
Note – Only fight for solving atleast one coding question.If you have not done any coding question then it doesn’t matter how many MCQ you have done you can not qualify for next round. I had started with coding question and did 1 question and only 10 MCQ and qualified for next round.
21 candidates were shortlisted.
Round 2(Face to Face)(30 min):
Introduce yourself -(Just a formality)
Asked about test and discussed coding question.(Must solve all coding questions before appearing in interview).
Then 2nd question –
1- print a binary tree diagonally.I told him the algo within 2 min then he asked me to write complete code (specially mentioned not pseudo code). It might contain some syntax error but it was not much of a concern. They only see whether are you able to implement the algo properly.
Then he told me there was an error in the code and that it doesn’t go correctly to next line.
I told him it’s correct lets run manually and check. The code was correct.
2-Subarray with 0 sum
I knew its solution and answered the best solution immediately. He asked me if I had done the question previously. I told not exactly same but I like competitive coding so I have done similar question. Then he extended this question and asked to print all sub-array with some some zero.(write proper code).
Then he discussed corner cases I told some then he gave some hint and after that I got the idea so, answered all corner cases.
Some questions asked from my friends->
1-Given an array A and a number x, check for pair in A with sum as x
2-Find a pair with given target in BST (expect inorder and reverse inorder solution)
3-Maximum width of a binary tree
4-Next larger element
5-Spirally traversing a matrix
Note- Same questions were asked by the same interviewer to many candidates so it is advisable to share questions with friends as they select you for next round only if you have done both of the questions.
9 people were shortlisted in this round.
Round 3(nearly 2 hours)-
1-Given a stream of number how you will maintain top 10 element. Whenever asked, the answer should be top 10 element till now. (answered in 2 min using min-heap).
very tough question. In 1 hour with the hint of interviewer I was able to answer this.
3- Some basic C questions – What is difference b/w Malloc, Calloc. Scenario when to use which one.
4- Data structure to use for undo and redo in text editor.
I took a lot of time but finally told its answer i.e. stack.
5- Lowest common ancestor of binary tree.(Proper code)
After this round 7 candidates were selected.
All thanks to geeksforgeeks for helping me with my preparation.
If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Related Practice Problems
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.