Amazon interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Amazon
2 rounds | 3 Coding
problems
Rejected
Interview preparation journey
Journey
In the college last year (07 semester), I joined coding ninjas c++ course for preparation. This course helped me in understanding basics of language and syntax. After this course i am able to crack multiple companies. I choose incedo inc as my first company. I used to do coding on Saturday and sunday . During my company time i learned java language with data structure from youtube. During my preparation i followed leetcode and some youtube courses. Currently i am working in infosys as specialist programmer.
Application story
This was an on-campus opportunity. There was 2 technical round. In both of the technical rounds, the questions were asked from OOPS, DBMS, OS, Computer Networking, and some DSA questions
Why selected/rejected for the role?
Rejected, i did not had that good competitive programming skills required to clear this company only very few students was able to clear this company's rounds.
Preparation
Duration: 6 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 : Prepare Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 2 : Give practices
Tip 3 : Work hard
Application process
Where: Campus
Eligibility: 7 CGPA
Tip 1 : Make it short and on to the point.
Interview rounds
01
Round
Easy
Online Coding Interview
Duration50 minutes
Interview date3 Mar 2022
Coding problem2
1. Count Number of Subsequences
Moderate
15m average time
85% success
0/80
Asked in companies
Given an array of non-negative integers ‘A’ and an integer ‘P’, find the total number of subsequences of ‘A’ such that the product of any subsequence should not be more than ‘P’.
A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.
Note
You need to print your answer modulo 10^9 + 7.
For Example
Let us take A = [1,2,3] and P = 4.
All the subsequences not having product more than ‘4’ are {1}, {2}, {3}, {1,2}, {1,3}. Therefore count is equal to ‘5’.
Problem approach
Step 1 : I first applied bubble sort. It was not good enough.
Step 2 : Interviewer asked me to optimise the solution.
Step 3 : Then i gave solution with merge sort and interviewer was happy.
2. MCQ Questions
Aptitude and tech
Number Of MCQs - 50
02
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date7 Apr 2022
Coding problem1
1. System Design Questions
What are semaphores?
What is virtual memory?
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 - 1
3 rounds | 5 problems
Interviewed by Amazon
Rejected
3085 views
0 comments
0 upvotes
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
Rejected
2295 views
1 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Amazon
Rejected
1593 views
0 comments
0 upvotes
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
Selected 8962 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 58238 views
5 comments
0 upvotes
SDE - 1
4 rounds | 8 problems
Interviewed by Samsung
Selected 12649 views
2 comments
0 upvotes
SDE - 1
4 rounds | 8 problems
Interviewed by Microsoft
Selected 5983 views
5 comments
0 upvotes