Amazon

Several Data Structures and Algorithms (DSA) rounds involved graph problems and binary search. I was asked to write code for burning a tree, a binary tree problem. Additionally, I was asked the question around Koko eating bananas.

The interview lasted for about one hour. Two coding questions were asked: * One was about array manipulation. * The other was about graphs. I was able to solve one question, but the other was difficult.

Two Data Structures and Algorithms questions and their solutions, featuring the least complex algorithms and code. This was followed by project discussions, detailing my role and the questions asked about it. The session concluded.