Amazon

It was good. I was asked 2 questions of Leetcode: * Minimum Operations to Make Binary Array Elements Equal to One I * Binary Tree Maximum Path Sum So the interviewer also gave me some hints.

I applied online. There is only one round and they asked 1 DSA question and questions under leadership principles. The DSA question is on graphs, it is of LeetCode hard, but we can answer it in that time constraint.

The session started with an introduction, and then we jumped to a DSA question. The first question was a multisource BFS, similar to the Rotten Tomatoes problem. The second question was about linked lists. Given a linked list sorted by absolute value