Round 4: Bar Raiser, Coding (1 hr.)
Introduction and Leadership Principles: We started with introductions, followed by a couple of leadership questions.
- Question 1: Given a Binary Tree, return the maximum sum of the subset such that no two nodes in any subset are adjacent.
- Question 2: Print the subset for last question
I completely solved question 1 with a dry run and discussed verbally how to improve the algorithm for printing the subset. I received the hiring feedback within a week, and the compensation details were finalized the following week.
Result
the
Contact Us