Started with an introduction, then a 45-minute LeetCode hard problem.
I needed to screen share and discuss my approach to solving the problem.
For the coding solution, they looked at the time and space complexities to evaluate the 'answer quality'. I was to explain my reasoning for how I arrived at that time and space complexity.
I have a list of integers representing the stock prices for each day. Write a function that returns the days to buy the stock and the days to sell the stock to maximize profit.
Initially, you can only buy. You can choose to not buy any at all. You can only sell after having bought, and you can only buy again after having sold. Try to get as close to O(n) time complexity as possible.
The following metrics were computed from 1 interview experience for the Amazon Software Developer Intern role in Vancouver, British Columbia.
Amazon's interview process for their Software Developer Intern roles in Vancouver, British Columbia is extremely selective, failing the vast majority of engineers.
Candidates reported having very good feelings for Amazon's Software Developer Intern interview process in Vancouver, British Columbia.