SDE - 1

I was told to design and implement digital wallet system. Users can be added in the system with their corresponding wallet. Users can execute transactions among themselves. Offers can be added in the system. Users can apply those offers whike making transactions

Given a binary tree, return the vertical order traversal of the values of the nodes of the given tree.

For each node at position (X, Y), (X-1, Y-1) will be its left child position while (X+1, Y-1) will be the right child position.

Running a vertical line from X = -infinity to X = +infinity, now whenever this vertical line touches some nodes, we need to add those values of the nodes in order starting from top to bottom with the decreasing ‘Y’ coordinates.

Note:

If two nodes have the same position, then the value of the node that is added first will be the value that is on the left side.

For example:

For the binary tree in the image below.

The vertical order traversal will be {2, 7, 5, 2, 6, 5, 11, 4, 9}.

Discussion was mostly revolved around my projects, resume and past experience