Frontend Software Engineer

You are given a binary tree with ‘N’ nodes.

Your task is to find the “Maximum Path Sum” for any path.

Note :

1. A ‘path’ is a sequence of adjacent pair nodes with an edge between them in the binary tree.
2. The ‘path’ doesn’t need to pass through the root.
3. The ‘path sum’ is the sum of the node’s data in that path. 

Gary is bored and wants to play an interesting but tough game. So he figured out a new board game called "destroy the neighbours". In this game, there are N integers on a board. In one move, he can pick any integer x from the board, and then all the integers with value x + 1 or x - 1 get destroyed. This move will give him x points.

He plays the game until the board becomes empty. But as he wants to show this game to his friend Steven, he wants to learn techniques to maximize the points to show off. Can you help Gary in finding out the maximum points he receives from the game?

This round was conducted on Google Meet using the coding platform and was a live coding round. The platform contained a small React project along with failing test cases. The goal was to fix the code in the respective files and make the test cases pass. The entire project had around 22 test cases, out of which I was able to pass nearly 12.

This round was also conducted on Google Meet using the coding platform and was a live coding round. The platform provided a React environment where I was asked to develop a React component similar to one of the components on the Coinbase website. The interview went well, and I received positive feedback from the interviewer.