Amazon | SDE1 | India | April 2022 [Reject]
About me:
- 2022 Grad
- Tier 3 college
- Computer Science
- Have Practiced DSA for more than 1 year.
How I applied:
- Applied for 6 months internship role in Oct 2021, received the test link, and cleared the test.
- Amazon didn't call me for an interview till Dec 2021 and then considered me for a full-time SDE-1 role.
Online Assessment-
- Two Medium level DSA problems, couldn't recall the questions but one was based on priority queue and the other was based on union-find.
Round 1:
- This round was scheduled in Feb, 2022.
- Interviewer starts with his introduction and asked about mine. And then asked 2 DSA questions and expected to write production level code.
- Question 1 was https://leetcode.com/problems/next-greater-element-i/ , the question was rephrased in the form of stock buy and sell type, but after I understood that it is next greater element question , I solved It.
- Question 2 was level order traversal of a tree and a follow-up - zig zag traversal of binary tree.
- Interviewer also asked a few technical questions related to trees.
This round was quite easy and the interviewer was very supportive.
After clearing round 1, I thought my next interview will be in a week or two, but I didn't receive any response from the amazon team. I did multiple follow-up emails and after a month I got the link for round 2.
Round 2:
- This round was scheduled after a month in April 2022.
- Again same process as the pervious one, only 2 dsa questions.
- Question 1 was https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k/
- Question 2 was https://leetcode.com/problems/maximum-profit-in-job-scheduling/ (LC hard)
- This round was hard for me.
For question 1, I was able to come up with optimized solution when array contains all +ve integers, but the interviewer wanted me to update the solution so that it works for -ve numbers as well. I was not able to modify the solution.
For question 2, I initially thought it has a greedy solution, but after some hints from the interviewer, I understood it was a DP question, while preparing for the interview I didn't give much importance to dp thinking amazon will not ask LC hard dp question, but I was wrong.
For this question I was able to code dp approach using recursion + memorization. I wasted 35 min coming up with solution and coding my approach .
The interviewer asked me whether I can optimize it further. I was not able to do that. Later I found that it can be optimized by using binary search + Dp.
After 2nd question, she asked technical questions like
- How does hashmap works in java?
- What are different greedy algorithms?
- Difference between prims and Kruskal's algorithm?
- And a few behavior questions.
After round 2, I knew I will be rejected but still I had some hope that I will be called for round 3.
I again sent them multiple follow-up emails because I didn't receive any rejection mail from them.
It's been more than 2 months since I gave round 2. I finally accepted that I was rejected/ghosted after round 2.
I will apply again after 6 months of the cool-down period and keep grinding LC.
Advice:
- Prepare all the important topics like graphs, tree and dp before interview, Don't leave any of them thinking it will not be asked by the company (Always prepare for the worst :) )
- Always communicate your thought process clearly with your interviewer so that he/she can guide you if you are stuck .
Thank you!


