On July 5, 1994, Jeff Bezos started the world's most "customer-centric" firm out of his garage in Bellevue, Washington. The American multinational technology corporation Amazon focuses on a wide range of industries, such as digital streaming, cloud computing, artificial intelligence, and e-commerce. Along with Google, Apple, Microsoft, and Facebook, it is regarded as one of the "Big Five" corporations in the American information technology sector.
Amazon is recognized for its massive industry disruptions brought about by technology innovation and size. Being the largest online retailer, provider of AI assistants, and cloud computing platform in the world, Amazon employs over six lakh people, of whom more than 50,000 are Indians. It is currently the second-biggest private employer in the United States and the largest Internet corporation in the world by revenue. Amazon has the largest global brand valuation as a result.
Interview Process
- Recruiter Connect: Best way to get noticed by Amazon recruiters is to maintain a good Linkedin profile and message recruiters. The candidate can also apply on the Amazon job portal but it is suggested that they also get a referral from an Amazon employee.
- Interview Rounds: Amazon conducts four interview rounds alongside an initial coding test. The coding test consists of DS/Algo problems. The first round is an HR round where they ask behavioral questions along with Computer Science theory questions to the candidate. The next three rounds focus solely on DS/Algo.
- After Interviews: The recruiter contacts the candidate after these rounds and tells the verdict. They also look at the candidate’s leadership principles along with technical skills.
- Hired: Once the team and you both are comfortable and ready to start, the offer letter is prepared and shared with you by the recruiters and you are HIRED!
Interview Rounds
Questions
- K largest elements from a big file or array.
- Find a triplet a, b, c such that a2 = b2 + c2. Variations of this problem like find a triplet with sum equal to 0. Find a pair with given sum. All such questions are efficiently solved using hashing. – Practice here
- Binary tree traversal questions like left view, right view, top view, bottom view, maximum of a level, minimum of a level, children sum property, diameter etc.
- Convert a Binary tree to DLL – Practice here
- Lowest Common ancestor in a Binary Search Tree and Binary Tree.
- Implement a stack with push(), pop() and min() in O(1) time.
- Reverse a linked list in groups of size k – Practice here
- Given two numbers represented by two linked lists, write a function that returns sum list – Practice here
- Rotate a matrix by 90 degree.
- Stock span problem
- Next greater element
- Some Dynamic Programming problems like:
- Maximum sum subarray such that no elements are consecutive – Practice here
- Edit distance
- Assembly line scheduling
- Why Amazon?