I applied online. I interviewed at Amazon (Dublin, Dublin) in Mar 2021
Interview
There were three tests, the first test was to debug seven codes in 20 minutes, I found this part easy. If you pass this test, you will go to the second step which is to solve two problems from scratch in 70 minutes. After answering questions about your personality in 20 minutes, they will check if your personality matches with Amazon Principles. I didn't pass the second test because I did not manage the time properly, so I can't talk about how the third stage is.
Interview questions [1]
Question 1
The first step was to debug 7 simple problems, basically, you have to find out why the code is not running correctly or the output is not as expected (things like a missing symbol or checking the return are good tips). In the second part, you will have to solve two different problems from scratch, you will have to analyze what it is asking you to do and code using the language you are most familiar with. Again, I can’t say anything about the third step, because I didn’t do that part of the process.
Standard LC mediums, nothing too crazy. Interviewer was pretty chill and was helpful in pointing me in the right direction when I needed as well. Only thing I would probably change was to study more on graph problems before hand.
Interview questions [1]
Question 1
You are given an 0-indexed integer array weights, where weights[i] represents the weight of the i-th marble, and an integer k.
Your task is to divide the marbles into k bags such that:
No bag is empty.
Each bag must contain marbles from a contiguous range of indices. That is, if a bag includes marbles at indices i and j, then all marbles with indices between i and j (inclusive) must also be included in that same bag.
The cost of a bag that includes marbles from index i to j (inclusive) is defined as weights[i] + weights[j].
The total score of a distribution is the sum of the costs of all k bags.
Return the difference between the maximum and minimum possible scores among all valid distributions.
Applied online and received an Online Assessment. It consisted of two LeetCode-style coding problems with a time limit . The process was straightforward and fully automated with no human interaction at this stage.
Interview questions [1]
Question 1
Solve a coding problem involving array manipulation under a timed online assessment
There were 2 rounds- one DSA round and one HR round.
In the first round they asked me a DP + trees question which was of medium to hard difficulty.
In the second round the interviewer asked me about my resume, my projects, some computer fundamental questions.