Hackerrank the story of tree - in contest

Feb. 19, 2017

Introduction 
Julia spent over a few hours to work on the algorithm - the story of tree, she really learned an important lesson about understanding a graph. She had fun to play with code, after a few hours, she scored points of 6, and then she continued to work on, scored up to 12 of maximum 50.

It is a struggle to push herself to think about the timeout issue, where to find the breakthrough to solve the timeout? Julia knew that the algorithm with a medium level should not be complicate, she enjoyed her struggle through early in the morning.

The algorithm is the second medium level one in university codesprint #2 on hackerrank. The contest is Julia's most favorite one, she still remembered the lesson she learned last year. It is hard and she remembered the pain as a programmer but she did better this time.

In the contest

Here is the C# code she submitted, the last submission over 10 of them in the contest. She continued to work on issues, through a few hours work after she scored points 6, she learned the important lesson how to make code simple, more simple, therefore, she can try some new idea.

What she missed is the time complexity of algorithm.

Julia got familiar with graph implementation, she knew that graph can be in any form, maybe, she does not have time to define node, edges, all she has time to make a list of hashtables. But it is a graph she likes to write for herself.