Five components (2.5 hours) :

Coding: 2 LC Medium level story-based problems. One on Binomial Coefficients (use DP to avoid TLE) and another on Heaps. I passed 10/10 on Q1 and 9/10 on Q2. Practice the past year's archives extensively to get an overall idea.
Debugging: 7 questions. Not hard as long as you have a good understanding of any of the OO languages (preferably C++)
Workstyle Assessment (HR) : 50 questions. You have to move the slider to your inclination for the particular question. Keep in mind the 14 Amazon Leadership Principles while attempting this section.
Reasoning Ability (Aptitude): 24 questions. Try to solve as much as you can, as many of the questions are follow-ups of the previous question.
Feedback Form

I solved all the questions in the given time frame (and had 20 minutes to spare). Each section has an individual timer, so always check how long a problem is taking to be solved. You have to solve every question to get a chance to clear this round, as the competition was very high. Only 40/1000 candidates were selected from this round.

In 4 days, I received the invitation for the technical rounds.

Round 2: Online round [Amazon Chime]

The interviewer was very strict on the timing. He stated that he would give two problems, and I was supposed to provide him with the optimized solution in the first go (unlike the usual method of starting from naive and reaching optimized)
Q1: Convert a given Binary Tree to a Doubly Linked List.
Q2: Given an array of strings with each string denoting a number, find the second largest number without doing type conversion (as the string value can be extremely high, and converting will not be efficient).

I gave him an answer using the strcmp() method. He gave me an edge case, and I fixed it by checking the string size also in the condition. There were only 5 minutes left, so I typed out the program as fast as I could while explaining the logic on the side. He asked the TC and SC, and I answered it right as well.

The interviewer said that while I struggled a bit initially, I was able to handle the pressure and do both sums in the short time given, and he was pleased with that.

I asked him a question based on the culture at Amazon, and after answering it, he wished me luck on the following round, and the interview ended.

After this round, I felt much more confident, and the second round was scheduled just 1 hour later.

Round 3: Online Round 2

This time, the interview started with introducing ourselves to each other. The interviewer asked me about my previous projects and internships. As I had done many Open-Source in the past, she asked me about my work's impact and my GSoC rejection story. I then talked about Javascript, Typescript, and React. She then asked in-depth about a project I put on my resume and about my current internship at a startup (responsibilities, progress in my work, etc.). After this discussion, I was given my first sum.
Q1: Given a complex string with characters going up and down, what must be done to print it. For this, I decided to use a char matrix and figured out the standard pattern of the up and down traversals. I coded it up quickly as I talked through the