I applied through an employee referral. I interviewed at Amazon in Nov 2021
Interview
I applied through a referral after I got a coding test link in which they've asked 2 coding problems and some reasoning questions. After that, I've got into the first technical round in which the interviewer asked me 3 DSA problems and I solved them. On the same day, I got a call from HR about my second round in that round interviewer asked me 2 DSA problems and we discussed a bit on projects as well.
Interview questions [1]
Question 1
1. OA : there were 2 coding problems given as well as reasoning given.
2. In my first technical round interviewer asked me about introduce yourself. Then asked me first DSA problem : generate all balanced parantheses string of size N
Second question was : find max elements of every K sized window in array.
Third question was : bottom level view of tree.
3. In second round of technical interview first she asked me about introduction and then projects that I've created and what kind of issues I've faced and how I resolved and what I learnt from that? After that we directly move forward with DSA question.
First question was about prefix sum and query.
Second question was finding LCA in binary tree.
I applied online. I interviewed at Amazon in Dec 2021
Interview
Smooth. Depends on who the interviewer is. They usually ask easy questions but I was asked a difficult one and the interviewer was not flexible for different solutions and there was not enough time to solve the difficult problem.
Interview questions [1]
Question 1
Cannot Disclose the Question asked. But it was Leetcode Medium/Hard.
I applied online. The process took 2 weeks. I interviewed at Amazon in Nov 2021
Interview
I managed to get to the OA step of the interview.
At the moment I did not know how to solve the problems because I hadn't researched anything on DS& Algos, just applied passively.
So I got a week between being told that I had an OA interview and 5 days to finish the OA. The OA is typically 70 minutes.
Interview questions [1]
Question 1
I got two questions. String manipulation (longest common prefix) and an array problem(I can't remember exactly which one). But I'd say the first one was medium and the second one was easy.