Amazon interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
Amazon
2 rounds | 6 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 Months
Topics: DSA, DBMS, OOPS, OS, TOC and Algorithms and parallel processing
Tip 1 : Here I would like to advise practicing many questions on data structures, DBMS and algorithms as you can because it is the question practice that would help you in building your concepts strong. I practiced a lot of questions on Interview from all modules of data structures and algorithms because there you can find the recent interview questions that you should know. It is the main crux of any interview
Tip 2 : Go through Leetcode in details as it has a good variety of questions sorted on topic wise difficulty level where you can try to solve at least 40 questions for each data structure, DBMS and algorithm. Regularly participate in the contests happening normally on weekly basis there so that you could know about your weak areas to improve. This will boost your confidence.
Tip 3 : Also clear about some basic concepts of Operating systems and Databases along with coding , that would help in your interviews. One more thing is that do some good research about the company's goal and vision and be prepared to ask some company-related knowldege and queries that show your interest in the company. This shows your interest about the company
Application process
Where: Other
Eligibility: No Backlog and above 6 CGPA
Tip 1 : Your Resume should consist of as many as good skills, projects, and achievements and award won, if any. Projects would play a crucial part in your interview and you should have at least one most relevant and good project that shows how strong your concepts are in development. The good project gives you an added advantage.
Tip 2 : Never fake on your resume and like If you have worked upon some technology for the project part only and don't know the proper depth you could write basics only in your resume. If an misleading information is provided by you than you are going to caught as you will not be able to explain if any question is asked around that.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration120 minutes
Interview date25 Aug 2020
Coding problem2
Debugging: This section contained 7 debugging problems, which were having code snippets that have logical error that needs to be analysed and recified.
Reasoning Ability: This section was aving medium level verbal reasoning questions and few aptitude questions.
Coding: This section was having 2 coding problems to be resolved.
1. Search in a row wise and column wise sorted matrix
Moderate
15m average time
80% success
0/80
Asked in companies
You are given an 'N * N' matrix of integers where each row and each column is sorted in increasing order. You are given a target integer 'X'.
Find the position of 'X' in the matrix. If it exists then return the pair {i, j} where 'i' represents the row and 'j' represents the column of the array, otherwise return {-1,-1}
For example:
If the given matrix is:
[ [1, 2, 5],
[3, 4, 9],
[6, 7, 10]]
We have to find the position of 4. We will return {1,1} since A[1][1] = 4.
2. Delete N nodes after M nodes of a linked list
Moderate
30m average time
65% success
0/80
Asked in companies
You have given a singly linked list and two integers 'N' and 'M'. Delete 'N' nodes after every 'M' node, or we can say more clearly that traverse the linked list such that you retain 'M' nodes then delete next 'N' nodes, continue the same till the end of the linked list.
Follow Up:
Try to solve this problem in O(N) time complexity and O(1) space complexity.
02
Round
Medium
Video Call
Duration55 minutes
Interview date31 Aug 2020
Coding problem4
The interviewer was very friendly and started asking me questions by making me comfortable.
1. Print Like A Wave
Easy
20m average time
80% success
0/40
Asked in companies
For a given two-dimensional integer array/list ‘ARR’ of size (N x M), print the ‘ARR’ in a sine wave order, i.e., print the first column top to bottom, next column bottom to top, and so on.
For eg:-
The sine wave for the matrix:-
1 2
3 4
will be [1, 3, 4, 2].
2. Rearrange Array Numbers to form Largest Possible Number
Moderate
35m average time
65% success
0/80
Asked in companies
You are given an array(ARR) of length 'N', consisting of non-negative integers. Using only these given numbers, rearrange the numbers in such a way that the resultant number thus formed is the largest possible. You cannot change the order of digits of a number.
For Example:
Given array numbers 12, 5, 34, the largest number you can form with them is 53412. There are other possible arrangements like 51234 or 34125, but they are both less than 53412.
Note:
As the final number formed after concatenation can be very large, print it as a string.
3. DBMS Question
Explain ACID properties
4. OOP Questions
1.What is the difference between static polymorphism and runtime polymorphism?
2. What is a copy constructor? Tell any one use of it.
3. Define inheritance.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - Intern
3 rounds | 3 problems
Interviewed by Amazon
Rejected
2162 views
0 comments
0 upvotes
SDE - Intern
3 rounds | 7 problems
Interviewed by Amazon
Rejected
1068 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
Rejected
1042 views
0 comments
0 upvotes
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
Selected 3501 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
Selected 15499 views
1 comments
0 upvotes
SDE - Intern
3 rounds | 6 problems
Interviewed by Microsoft
Selected 8186 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 4 problems
Interviewed by Microsoft
Selected 4914 views
2 comments
0 upvotes