Status: 1.2 YOE in a Service Based Organization
Position: SDE1 at Amazon
Location: Bangalore, India

Online Coding round(22-02-2022):
This round was taken on hackerearth platform and has 2 programming question.
Q1: The size of a contiguous segment is the number of contiguous processes in main memory.
Find the minimum amount of main memory used by all your processes in your instance after you delete a contiguous segment of processes.
Example:
process = [10,4,8,13,20]
m = 2

Q2: Don't remember the exact question but can be solved using priority queue.

Amazon Chime interview round 1 (08-03-2022):

Q1. Given 2 integers x and y, and 3 operations op1, op2 and op3. What is the minimum number of operations to reach y from x.

+ , - , * , / ( XYZ % op == 0)
For eg : 
X = 15, Y = 1 , OP /2 (%2 == 0) , +1 , -1
15 ----> 1 === 15 -1 = 14 -1= 13-1=12 -1 =11 ----> 1 : Steps 14

Q2. Find the median of a stream of integers.

Amazon Chime interview round 2 (16-03-2022):

Q1. Given an M × N matrix, where each row and column are sorted in ascending order, you need count the total number of negative elements present in it.
Q2. Given a binary tree, calculate the sum of all nodes for each diagonal having negative slope.

           1
         /   \
        /     \
       2       3
      /        / \
     /        /   \
    4        5     6
            / \
           /   \
          7     8

Return [10, 15, 11]

Bar-Raiser Round-3 (25-03-2022):
Q1: Modification of Trapping Rain Water-II

Q2: Modification of Maximal Square

Some generic LP Questions.

Remarks:
I was able to complete all the rounds till round 2. I solved all the questions optimally and after solving every question explained the Time & Space complexity.

Reason of getting rejected:
In the bar-raiser round the interviewer was an SDM. He told me write the code without explaining and said he will check the code after I complete it. I have written the code and it was not able to run some test cases but instead of modifying the code he said to write the code again completely. This question alone took 30 minutes.
Now, (this is the part I think which leads me to rejecting :( ).
For the second question, I wrote the program but in a hurry instead of writing Math.min(dp[i][j - 1], dp[i - 1][j]), dp[i - 1][j - 1], I wrote Math.min(arr[i][j - 1], arr[i - 1][j]), arr[i - 1][j - 1] and since the the arr given was of type char he said it will not run. I immediately realised my mistake and changed arr to dp. I think he got triggered and said thst he told earlier already to not modify the code. After that he closed the code share and asked some LP questions and went away. This happened with me for the first time that an interviewer instead of asking the approach is just interested in the code that too passing all the test cases in one go.

I tried so hard and got so far But in the end, it doesn't even matter.

Other Offers: Jio, Morgan Stanley, PayU.
I chose PayU as SDE-1 with base similar to Amazon :)

If anyone wants to connect with me on LinkedIn they can ping there LinkedIn profile in the chat. I'll surely connect with you.

Peace.✌️