Kivi Capital | New graduate | Off campus | 3rd January

Round 1 Telephonic round. Problem 1 Given a tree with N nodes. Root node has some information initially. Any node which already has information can pass it to exactly one of its child in 1 unit of time. As soon as any node gets information, it starts passing it down to its children. How much time will it take for information to propogate to all of the nodes? Problem 2 There exists an hidden array A of size N. It ...