Amazon is an American electronic commerce and cloud computing company based in Seattle, Washington that was founded by Jeff Bezos on July 5, 1994. The tech giant is the largest Internet retailer in the world as measured by revenue and market capitalization, and second largest after Alibaba Group in terms of total sales. The amazon.com website started as an online bookstore and later diversified to sell video downloads/streaming, audiobook downloads/streaming, software, video games, electronics, food, toys, and jewelry. The company also produces consumer electronics—Kindle e-readers and Echo — and is the world’s largest provider of cloud infrastructure services (IaaS and PaaS). Amazon also sells certain low-end products under its in-house brand AmazonBasics.
In 2015, Amazon surpassed Walmart as the most valuable retailer in the United States by market capitalization. Amazon is the fourth most valuable public company in the world (behind only Apple, Alphabet, and Microsoft), the largest Internet company by revenue in the world, and after Walmart, the second largest employer in the United States.
Amazon conducts 5-6 rounds to select freshers as SDE (SDE-1) in their organization. The following rounds are conducted:
- Written Round
- Online Coding Round
- Multiple Technical Rounds
- Hiring Manager Round
- HR Round
The Written round majorly consists of two sections namely Aptitude / Logical Test and technical test. The technical test contains questions mainly from C, C++, Operating System, Data Structure, inheritance, functions. Generally in MCQ format with a given time frame of about 30 minutes.
Online Coding Round:
This round is hosted online and the candidates are presented with 3-4 coding questions, the questions are of intermediate difficulty, mainly from Arrays, strings, and matrices.
To clear this round, one should have a strong understanding of these data structures.
This round is purely algorithmic based with around 2-4 questions ranging from arrays, trees, to dynamic programming problems. You are to present algorithm and in some questions, the code also if necessary. Apt candidates are selected for further rounds.
Technical Round 1:
Technical rounds are face-to-face algorithmic rounds in which candidates are presented with 2-4 questions, all from data structures. The most commonly asked DSs are the matrix, binary tree, BST, Linked list.
Technical Round 2:
Same as previous round, however the difficulty is increased and more questions from Trees, BST, and Tries are asked. One should have a clear knowledge of tree-based recursion, and the standard questions based on it are a must.
Hiring Manager Round:
This is generally the most technical-intensive round, with questions ranging from the projects you have done, the technology used in them, design problems and DS/Algo problems and tricky puzzle-like questions.
You can expect HR questions like :
1. Tell me about Yourself, your family
2. How do you see yourself five years from now?
3. What are your strengths and weaknesses?
4. Some technical questions can also be asked from topics like OOPs.
Questions asked in Amazon:
- Kadane’s Algorithm
- Angle b/w hour and minute hand
- Inversion of array
- Paranthesis Checker
- 0-1 Knapsack
- k Largest elements
- Longest Palindromic
- Array to BST
Where to apply?
- Fab.com Recruitment Process
- Treebo Recruitment Process
- Dell Recruitment Process
- FactSet Recruitment Process
- eBay Recruitment Process
- IBM Recruitment Process 2019
- Arcesium Recruitment Process
- CarWale Recruitment Process
- BARC Recruitment Process
- Bloomberg Recruitment Process
- Flipkart Recruitment Process
- Adobe Recruitment Process
- Microsoft Recruitment Process
- OYO Rooms Recruitment Process
- Cisco Recruitment Process
- SanDisk Recruitment Process
- 3DPLM Recruitment Process
- Samsung Recruitment Process
- Swiggy Recruitment Process
- CouponDunia Recruitment Process
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.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.