Open In App

Amazon Interview Experience | 380 (On-Campus)

Last Updated : 07 Jan, 2020
Like Article

Amazon Interview experience

Online Round

Platform: HackerEarth
Format: 20 MCQs, 2 coding questions
Time: 90 minutes

MCQs: Data Structures, Networks, OS, etc.
Q1) Maximum j – i such that a[j] > a[i]
Expected Solution in O(n)

Q2) Maximum of minimums of every window size

40 candidates were selected for the PI. 20+ candidates were rejected after first PI. Only 8-9 went till final round. 5 were finally selected.

ROUND 1:(45 mins)

Ques 1) All permutations of a string

Ques 2) Permutations with duplicates

Ques 3) Connect nodes at each level in Zig-Zag pattern.

ROUND 2:(60 mins)

Ques 1) Given an array of size N, there exist a pattern such that, a[i]-M <= a[i+1] <= a[i]+M . Suggest an algorithm to search for a number in the given array.
The solution should be better than O(n).

He gave hints like consider M to be much much less than N, etc. I gave him many approaches but couldn't give him a concrete algorithm. He said we will discuss this later and gave another problem

Ques 2) Imagine a land in a form of grid. There are enemies to the North of the land. And soldiers to the West of the land. Soldiers in the West want to know if there are enemies to the North. So they decide to place mirrors at a 45-degree angle in the grid land. If they place a mirror at (i,j) then they can see the enemies in the jth column. Similarly, they will put mirrors in other places in the grid to view the enemies in other columns. Now it is given that some of the cells of the grid are rocky area and a mirror cannot be placed in those cells.


  Walls   | Enemies
            _ _ R _ 
Soldiers    _ _ _ _ 
            R _ _ _
            _ _ _ R

  Walls   | Enemies
            _ _ R _ 
Soldiers    / _ _ _ 
            R _ _ /
            _ / _ R  

In the above solution, / represents a mirror.
Using the above configuration, the soldiers are able to look at the enemies in column 0, 1 and 3.
Note there is no way to see enemies in column 2 as the rocky area will block the vision.
There can be at most one mirror in one row and at most one mirror in each column.

You have to give any one solution that puts the maximum number of useful mirrors possible.

I solved this by first marking out the useless cells. and then placed mirrors in a greedy manner.
Time complexity: O(n*m)

Ques 3) You have been given a regex and a string. Return true if the string matches the regex and false if not.
The regex has only * ? and English alphabets.
* means any character occurring zero or more number of times.
? means any character occurring exactly once.

regex: *aab?c
string: dbvaabcc
output: True

regex: *c*
string: ca
output: True

regex: ?c?
string: ca
output: Fasle

I solved this using recursion. Explore all possible paths.

ROUND 3:(Bar Raiser) 90 mins

This round was taken by a senior guy. He was very experienced and extremely smart.
He started with my CV. Asked about my internship experience and the project that I did during my internship. My project was on a NoSQL database so questions on them. He asked me to explain why my project was important to the organisation. What all I learnt, etc. He gave me very tricky scenarios and asked me how I would handle those cases in my NoSQL database. How will I protect my database against hackers, etc? Few Distributed System question on Consistency, Availability, etc. The project discussion went on for about 15-20 min.

Ques) He then told me to imagine a large chunk of files with lots of sentences in them. I have to find out programmatically which are the important words in them. Which words convey more meaning?
I gave him few approaches. I kept on saying something or the other. He was fairly satisfied and move on to next question.

Ques) Stock span problem
He asked me all the possible variations of the above problem.
I kept on giving solutions and he kept on modifying it, putting constraints, etc. He grilled my concepts with this problem.

Ques) You have a large string of 0’s and 1’s. Re-arrange the given string according to a formula:
f(i) = f(i-1)*f(i-1) – f(i-2)*f(i-2)

f(1) = 1 and f(2) = 2 is given.
f(3) = 2*2 – 1*1 = 3
f(4) = 5
f(5) = 16

Arrange in a sequence such that you have f(1) 0’s and f(2) 1’s and again f(3) 0’s and so on. Append the remaining 1’s or 0’s in the end.

string: 1011001010011 // 7  1's and 6 0's
output: 0110001111100

Do this in-place and in O(n).

He was very satisfied with my elegant code and told me I did well. I was immediately informed that I will have my 4th round shortly.

ROUND 4: (50-60 mins)

This round focused mostly on Computer Fundamentals and CS concepts. He did not ask me any DS or Algo question in this round.

He asked me to introduce myself and then asked about my favourite subjects.
He asked me a lot of questions on Exceptions.

1. What are exceptions? How do you use them?
2. What is a Runtime Exception? Give examples.
3. Should we catch a RuntimeException? When? Why? How?
4. The advantage of using exceptions, etc.

He then moved on Threads.
1. What are threads?
2. Threads Vs Process?
3. The advantages of threads?
4. How to synchronize threads?
5. Producer-Consumer design using threads.
6. Thread life cycle
7. How threads communicate?

Asked me to write an Object Oriented code for a Banking application using Threads. Only Deposit, Withdraw and Check Amount feature should be implemented.
I told him I don’t have these concepts fresh in my mind but he still insisted me to do it.
I was struggling with the code so he told me to leave that and moved on to Computer Networks.

1. What is FTP? How is different from Secure FTP?
2. How TCP works? What is 3-way handshaking?
3. What happens when I make a URL request from my web browser?
4. What is a peer to peer network? How does it work?
5. What is scp command in Linux? What does it do?
Few other questions.

I did not perform good in Round 4 and was rejected.

GeeksForGeeks was a great help during my preparation. Thanks to other students for sharing their interview experience. 🙂

Previous Article
Next Article

Similar Reads

Amazon Interview Experience SDE-1 | Amazon-WOW 2020
4 Technical rounds: First Technical Round: 1. Given two arrays and we need to find whether one array is a subset of other or not Ex: array1: 1 6 5 array2: 1 4 7 3 5 6 o/p: yes 2. Given a matrix and there will be bombs in the cells, find the number of blasts. A group of connected bombs leads to blast. 3. Level order traversal of a tree. Second Techn
2 min read
Amazon SDE-1 Interview Experience | Amazon WOW-2020
Online Test: The first round contain easy to medium questions. The online test consists of 28 MCQs in which there were general aptitude questions, OOPS, output, Data structure etc. In addition to this, there were 2 coding questions. Q1). Q2).Find the position of leftmost and the rightmost set bit, a
2 min read
Amazon Interview Experience for SDE-1 | Amazon-WOW 2020
Amazon has a special program called AmazonWOW for women. It is to promote women in technology. It is a very good opportunity for women as they have to only compete with other females, not with males. The online application came in April. The program consists of a two-month internship for prefinal year student and fulltime plus Internship for final
8 min read
Amazon Interview Experience for SDE-1 (Amazon Wow drive)
I applied for role of SDE I through Amazon WOW drive 2020. There were a total of 5 rounds (1 coding test + 4 interviews). Originally interviews were supposed to be offline but because of coronavirus pandemic, I gave my interviews online. Round 1: Round 1 was online coding round consisting of 2 coding questions and 28 MCQs based on C, C++, Java, dat
5 min read
Amazon Interview Experience | On-Campus
Campus: NIT Jalandhar Date: Aug 2019 Round 1: It was a coding round, of 1hr 30 min, with two questions and 28 MCQ mostly based on data structures and concept of c/c++. Throw dice problem. Evaluation of postfix expression. Rou
2 min read
Amazon Internship Interview Experience | On-Campus 2021
Round 1: Online Assessment: Debugging: Solved 7/7, time limit was 20 minutes.Coding: on binary search.Worklife assessment: Don’t know the time limit, was sufficient. (The mail mentioned it would be 20 minutes but there was no timer in this section).Aptitude:
3 min read
Amazon Interview Experience for SDE-1 (Off Campus)
I was contacted by Amazon recruiter for SDE-1 role. Coding round: 2 simple coding questions were asked . (don't remember exactly), you need to solve both questions to get a call for interview. Round 1 (Coding Round): This round was taken by senior SDE-2. She ask me to give introduction about my-self and then directly jumped into coding questions. F
2 min read
Amazon Wow Interview Experience for SDE Internship (On-Campus) 2022
Round 1: Online Assessment 1: Platform: Mettl. Sections contained: DSA, CN, DBMS, Software development concepts, and 1 coding question. Verdict: cleared this round and received mail after a few days. Round 2: Online Assessment 2: Platform: Hackerrank 2 LC medium coding questions. ( 1 was from the array and 1 was from a string) was able to solve bot
1 min read
Amazon Interview Experience March 2019 (Off-Campus -Cloud Associate 1)
Received a Mail from off-campus recruiter, to take a online test for the role of cloud support associate 1. Had Registered and applied in Amazon website . Round 1: Online Test : duration 1.5 hours . Contained 4 sections . General Aptitude, Technical round 1( concepts of OS, Computer Networks, DBMS, all of them in depth ), Technical round 2((Concept
3 min read
Amazon Interview Experience (On-Campus)
Amazon On-Campus Hiring : 2019 Round-1 (Online coding round): It was 90 minutes long coding round on mettl test. It consisted of 2 coding questions and 28 MCQs. coding questions were easy to medium category. First question was to change one string into another with some modification (pretty much implementation question). In second question, you are
4 min read
Practice Tags :