Amazon interview experience Real time questions & tips from candidates to crack your interview
Cloud Support Associate
Amazon
4 rounds | 7 Coding
problems
Selected Interview preparation journey
Journey
I started my coding journey from the second year of graduation. I asked and consulted seniors on how to start in my career. I started doing DSA. In starting it was not regular but from the seventh semester, I started practicing DSA on regular basis. Meanwhile I also learned Web Development in the last phase of third year. Than, I was ready to apply in different companies.
Application story
I got to know about the openings for candidates as Cloud Support Associates through my friend working in the company. I applied through a referral and prepared myself for the same, and after the selection process, I got the offer letter.
Why selected/rejected for the role?
I think I was on point with my coding solutions to the questions asked in the interviews. I provided the optimal solutions and I was giving correct explanations to some theory questions asked.
Preparation
Duration: 0.5 month
Topics: Operating System, Networking, Troubleshooting in Networking and OS, Data Structures, Algorithms, Amazon Leadership Principles
Tip 1 : Focus more on troubleshooting in OS and Networking
Tip 2 : Practice basis coding questions
Application process
Where: Referral
Eligibility: No
Tip 1 : Descriptive projects and previous work ex
Tip 2 : Simple and clear
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date25 Feb 2021
Coding problem2
MCQ Questions from every topic: Aptitude, OS, Networking, Javascript, ML, DS
2 coding question
1. Sum of Factors
Moderate
40m average time
70% success
0/80
Asked in companies
You are given an array/list of integers, your task is to find the sum of all the factors of each number in the array.
For Example:
For āNā = 10
All factors are 1, 2, 5, 10.
So, the sum of them will be 18.
Problem approach
Let p1, p2, ā¦ pk be prime factors of n. Let a1, a2, .. ak be highest powers of p1, p2, .. pk respectively that divide n, i.e., we can write n as n = (p1a1)*(p2a2)* ā¦ (pkak).
Sum of divisors = (1 + p1 + p12 ... p1a1) *
(1 + p2 + p22 ... p2a2) *
.............................................
(1 + pk + pk2 ... pkak)
We can notice that individual terms of above
formula are Geometric Progressions (GP). We
can rewrite the formula as.
Sum of divisors = (p1a1+1 - 1)/(p1 -1) *
(p2a2+1 - 1)/(p2 -1) *
..................................
(pkak+1 - 1)/(pk -1)
2. Stock Span
Moderate
20m average time
65% success
0/80
Asked in companies
Afzal has been working with an organization called 'Money Traders for the past few years. The organization is in the money trading business. His manager assigned him a task.
Given an array āpricesā which denotes stock prices for ānā days, e.g., 'prices[ i ]' = price of the stock at āithā day, Find the stock's span for each day.
The span of the stock's price today is defined as the maximum number of consecutive days(starting from today and going backward) for which the price of the stock was less than today's price.
Example:
Input: ānā = 7, āpricesā = [100, 80, 60, 70, 60, 75, 85]
Output: [1, 1, 1, 2, 1, 4, 6]
Explanation:
On the sixth day, when the stock price was 75,
The span came out to be 4 because the last three prices(plus today) were less than the current or the sixth day's price.
Similarly, we can deduce the remaining results.
Note:
You donāt need to print anything. Just implement the given function
Problem approach
We see that S[i] on the day i can be easily computed if we know the closest day preceding i, such that the price is greater than on that day than the price on the day i. If such a day exists, letās call it h(i), otherwise, we define h(i) = -1.
The span is now computed as S[i] = i ā h(i).
To implement this logic, we use a stack as an abstract data type to store the days i, h(i), h(h(i)), and so on. When we go from day i-1 to i, we pop the days when the price of the stock was less than or equal to price[i] and then push the value of day i back into the stack.
03
Round
Easy
Video Call
Duration40 minutes
Interview date21 Mar 2021
Coding problem2
Networking Troubleshooting
04
Round
Easy
HR Round
Duration30 minutes
Interview date21 Mar 2021
Coding problem1
Asked questions on Amazon Leadership Principles and from resume
1. Basic HR Question
Explain the projects and problems faced in them and how did you overcame them.
Problem approach
Tip 1 : Try to converse with the interviewer. Be confident and relate your answers with company's leadership principles.
Tip 2 : Use situations from recent time/work examples.
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
Cloud Support Associate
4 rounds | 5 problems
Interviewed by Amazon
Selected 
1821 views
1 comments
0 upvotes
Cloud Support Associate
4 rounds | 4 problems
Interviewed by Amazon
Selected 2336 views
0 comments
0 upvotes
Cloud Support Associate
4 rounds | 3 problems
Interviewed by Amazon
Selected 2975 views
0 comments
0 upvotes
Cloud Support Associate
3 rounds | 8 problems
Interviewed by Amazon
Rejected
501 views
0 comments
0 upvotes