I was sent a HackerRanker with two hard-level LeetCode questions. Each question was rephrased to be about an Amazon problem, e.g., package delivery or AWS scaling.
I answered both questions fully but did not get a response. I couldn't see how to do one problem in less than O(n^2).
Given a number of packages of varying lengths (integers). Create deliveries (i.e., subsequences) that are balanced (the last element is less than or equal to at least one element before). Return the maximum number of possible balanced deliveries.
The following metrics were computed from 2 interview experiences for the Amazon New Graduate Software Engineer role in London, United Kingdom.
Amazon's interview process for their New Graduate Software Engineer roles in London, the United Kingdom is extremely selective, failing the vast majority of engineers.
Candidates reported having mixed feelings for Amazon's New Graduate Software Engineer interview process in London, United Kingdom.