OA 1(20 minutes 7 Questions) - Debugging : Clear
OA 2(2 Competitive Coding Question in 70 minutes from Leetcode medium and hard) - Coding :
Question 1 : All Test Case including hidden cleared
Question 2 : 2 Test Case cleared, hidden remaining(that makes the difference for the last round of screening interview)
OA 3 - Work Simulation : Clear

Then I Got final round of interview with 3 Round of Interview 45 minutes each with Different Teams.

Technical Screening Round Amazon

Round 1: Clear with Flying Colors

Coding Question:

We need a function that takes a list and returns the duplicate index.
The list is guaranteed to be in monotonically increasing order and to have only one duplicate value.
And each value is one greater than the last.
Ex1:
0,1,1,2,3 -> 2
Ex2:
100,101,102,103,103 -> 4
Ex3:
li = [0,1,2,3,...,55,55,...,99,100]
li[0] -> 0
li[101] -> 100
li[60] -> 61

Behavioural:

1. Challenges you have faced
2. Challenges faced in real life (not in Company or a Startup)

Round 2: Clear with Flying Colors

Coding Question:

Given an array A and a number X, can you find a triplet in the array that adds to the number X
A[] = {1, 29, 4, 6, 2, 77, 8}, X = 7
returns (1, 2, 4)

Behavioural:

1. Tell me about a time when you have no clear instruction
2. Tell me about a time when you have limited time to complete the task

Round 3: Interviewer was slight rude

Behavioural:(about 25 minutes)

1. Time when no instruction specified
2. Time how you handled the situation when you have to commit something to client
3. Tell me about a time when you have to go beyond for commitment

Coding Question:(20 minutes)

Find the next value from the target node using BST

1. Ask approach, provided him but he directed to only using BST.
2. Asked again what approach I’ll be using while solving this problem.

And provided only 5 minutes to write a code for this problem

Got Rejection from Amazon