Given a binary tree, print its each diagonal sum.

Coding Round - Three questions were there. -First one was easy stock buy and sell problem. - Second one was tree based hard problem . Similar question would be - number of ways to build ant colony on Leetcode. - Third quesition was medium array based problem Interview Round 1 - Two coding questions were there and then a little discussion on coding round questions. - First one was number of rooms required of arrival and departure dates of bookings is given. - Second one was a array problem. In the problem array of integers was given and we can apply 1 operation which increases the value of a element by 1. We were given the max number of possible operations and asked to find the maximum frequency of any element we can get. Interview Round 2 - Coding question was - Boundary Traversal of a Binary Tree. After which he asked me some DBMS and OS question. I was rejected in this round :(