Status: <2 YOE
Currently 4th year SE student at University of Western Ontario
Position: New Grad at Amazon Luxembourg
Date: Mar, 2020

Interview Timeline

Started OA1 around 5 months ago and recieved OA2 shortly after. I don't recall the questions but they were similar to the ones in the stickied Amazon question thread. I recieved an invitation for an onsite in Dec 2019 but declined due to final exams. My recruiter said that there may not be positions available if I declined but I didn't have any other choice.

In Feb 2020 my recruiter got back to me saying that I could interview on Feb 27. I was reluctant because I had midterms at the time but I decided to go anyway.

Interview Questions
There were 3 rounds of interviews at 60 min each. 5-10 minutes at the beginning for behavioural questions, 45 minutes for coding and then 5 minutes at the end for asking questions.

Q1
The question was similar to an LRU cache or LFU cache. I forget the question but the solution required a doubly linked list and a HashMap.

Q2
This question was given an array of iterators for sorted arrays. Create a new iterator with next() and hasNext() that return the value of the entire sorted array. I used a Priority Queue.

Q3
This was the third question. https://leetcode.com/problems/first-missing-positive/

My runtimes and space times were all optimal except for Q1 where I was told it could've been O(1) but I only got it to O(n).

Conclusion
My recruited called me today (Mar 13) to tell me that I succeeded in the interview process however there are no open positions at Amazon Luxembourg so they will try to find me another position in Europe.

Overall I am very happy because earlier in the year I interviewed at Amazon Vancouver (Skype) and Google Waterloo (Onsite) and was rejected by both so I was feeling pretty down about those. It feels good to finally get one! For those who are feeling down because they were rejected just keep pushing and working hard and you will succeed!

Since I started doing leetcode ~5-6 months ago I have gotten much better at Algo problems and would like to thank everyone on this community who gives the time to properly explain things and provide optimal solutions and experience.

And finally my numbers 68E / 69M / 9H.