Amazon

Two LeetCode questions and a work simulation. One hour of screen coding, focusing on a single LeetCode question. Three hours of loop practice, incorporating Amazon principles and coding. This includes OOP, algorithms, and data structures.

It was a 2-3 round process, depending on how your interview went, with increasingly hard DSA questions followed by some HR and behavioral questions. First round was mostly easy and medium LeetCode, followed by medium and hard questions in the second

The first round was a HackerRank. The question was related to joining servers together, if the value of `[i+1]` is greater than `[i]`. The second was the maximum subarray problem. I solved it with two pointers, but it should be done with dynamic pro