Amazon

It was a decent interview. The interviewer was nice and asked DSA questions. Behavioral questions were also asked. I went through two rounds before being rejected. Each round was one hour long.

It was good. He first introduced himself and directly jumped into DSA problems. The first question was the maximum branch sum in a binary tree. The second was to reverse a stack without using extra space.

Online Assessment (OA) that covered two key areas: DSA (Data Structures & Algorithms): Typical competitive-programming style problems such as arrays, strings, trees, graphs, dynamic programming, etc. Often includes time/space complexity considerat