Position: https://www.amazon.jobs/en/jobs/843122/systems-engineer

Round 1: [Behavioral + Coding]

• Behavioral Questions
• Variation of https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size/ (premium)
  Binary Array (0 or 1) in sorted of infinite size, find the shift index from 0 to 1.
  I answered in brute force way using for loop with O(n) time complexity, but interviewer asked to reduce time complexity and he suggested to use binary search algorithms. So i grap the idea and used divide conquer approach to shift index from 0 to 1 in a infinity array. we have to use Logarthimic exponential i.e 2^2,2^4 index to find the shifit from 0 to 1.
  this will reduce complexity as Log(n)

Round 2: [Hiring Manager]

• Standard Amazon Behavioral Questions. Mostly he is happy with my answer in STAR format.

Round 3: [Coding]

• Standard Amazon Behavioral Questions.
• Find the duplicate elements in array
• https://leetcode.com/problems/fizz-buzz/

Round 4: [Bar Raiser]

• Standard Amazon Behavioral Questions. He is not happy with answer and asking more clarificaton on answer in differernt format
• https://leetcode.com/problems/two-sum/
  Find the pair in the array for sum
  a[]={1,2,3,4,6} sum =7
  pair {3,4} and {1,6}
  I have answer in brute approach with two for loop O(N^2). Please suggest better solution for me.

Round 5: [System Design]

• Standard Amazon Behavioral Questions.
• Expain the Amazon Order history (E2E) design and performance improvment. He is happy with my answer.

Feedback from Amazon: technical improvement.