Amazon Interview Experience for SDE 1 Role

Round 1 (Written) (easy):

Section A (coding) (Platform: hackerrank.com)

1. Search an element in a sorted and rotated array https://www.geeksforgeeks.org/search-an-element-in-a-sorted-and-pivoted-array/
2. Largest Rectangle in a histogram (https://www.geeksforgeeks.org/largest-rectangle-under-histogram/)

Section B (behavioral)

1. This section consists of questions that majorly focus on your personality and behavior.

Round 2 (Technical Interview) (easy):

1. K maximum sum combinations from two arrays https://www.geeksforgeeks.org/k-maximum-sum-combinations-two-arrays/
2. Swap Kth node from beginning with Kth node from end in a Linked List https://www.geeksforgeeks.org/swap-kth-node-from-beginning-with-kth-node-from-end-in-a-linked-list/

For the above two questions, I was asked to write complete code. After this, i was asked few basic questions

1. How to know whether the linked list contains any cycle or not
2. What is semaphore
3. Normalization

Round 3 (Technical Interview) (easy):

1. Find if k bookings possible with given arrival and departure times https://www.geeksforgeeks.org/find-k-bookings-possible-given-arrival-departure-times/
2. Find minimum number of rooms required to accommodate all bookings (addition in 1st question)

Round 4 (Managerial Round) (Medium):

1. Add all greater values to every node in a given BST https://www.geeksforgeeks.org/add-greater-values-every-node-given-bst/
2. Amazon principles

• The time when you exceeded expectations
• The time when you fail commitment
• The time when you help a teammate
• The time when you pushing your idea
• The time when you got bad feedback from your manager
• The time when you innovate something

Round 5(Bar Raiser Round) (Medium):

1. Maximum Path Sum in a Binary Tree https://www.geeksforgeeks.org/find-maximum-path-sum-in-a-binary-tree/
2. Given a list of IP’s find all unique IP’s present
3. What is deadlock
4. Basic questions on Threads