Amazon Interview Experience | Set 360 (On-Campus)
Round 1: (Online Test)
Time: 1hr 30 mins on HackerEarth Platform
20 MCQ (Gen Apti, OS, TOC, Networks and DS)
- Maximum non adjacent subsequence
- Profit sort (Find no. of elements in the given range)
Round 2: (Problem Solving Round)
Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!
Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsft, TCS, Wipro, Google and many more!
- Vertical Sum of Binary Tree.
Discussion about various data structures that can be used. Finally came up with hash map.
- Width of Binary Tree
- How map is internally stored in C++?
- If N students in a class play a game against each other where each student plays against all other students in the class, find the total number of matches to be conducted.
Also, if the class leader has to arrange the students in a line where each student would have lost the match with the student in front of him (Remember: student may or may not have won the match with the student front of front of him). Design a suitable data structure for maintaining such an order.
Round 3: (Data Structures and Algorithms Round)
- Project Discussion
- There are various libraries that a Kindle app may use. All these libraries must be linked appropriately to be included in Kindle. There will be dependencies between the libraries. Apply a suitable data structure such that a library cannot be added before its dependencies. I discussed a topological sort approach. Finally wrote code and tested the same.
- Discussion about second coding question asked in the online test. I was asked to bring up a better solution, given, that I can use extra space. I proposed an approach based on hashing and counting sort.
- Threads vs Process. They were impressed because I explained with a real-time example
- How the Program is stored in memory? Stack frame for Program?
- When two threads access a code at the same time, what happens. How is it prevented?
- Difference between mutex and semaphore.
- Priority Inheritance and Priority Inversion.
Round 4: (CS Fundamentals)
- Tell me about yourself
- Design a music player application
I was asked to first list out all possible features to be added within 2mins time. I came up with around 30 features. The interviewer selected a few of those features and asked to draw a class diagram for the same.
- I have a DB of some size as of now. In future new DB with additional space will be added. How will the DB be modified? What to modify? How to scale it?
- Distributed computing concepts
- Multiple partitions in OS
- MVC design pattern
- My costliest mistake in life
- Asked something interesting about myself that others don’t have.
- Whether I like back-end or front end. Reason out.
Round 5: (Bar Raiser Round)
- Project Discussion
- There are k stars in the space and an origin star, find the nearest 100 stars from the origin star.
I came up with brute force approach first.
Later devised a max heap solution and coded the same
- Virtual Machine
- About AWS, S3
- Design Patterns. Asked to implement Singleton Design Pattern in Java
- Scheduling Algorithms. Which scheduling algorithm does modern operating systems use?
- Strength and weakness
- Latest technical knowledge that I gained. Recent technical article that I read.
- Maximum amount of code that I had ever written in college.
- Any Questions from my side?
I was one among the three to be selected from my college for Full Time SDE at Amazon
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.