January 19, 2016
Julia spent a few hours to work on the algorithm "Value of friendship" code review using union-find algorithm. She needs to go back to basics, read some lecture notes as well.
Code with unit test cases, study first (ID: yambe2002, ranking: 111/10432), link is here. Code review, link is here.
She found one for her to read - one or 2 hours, after that she will go back to read more C# code.
Lecture notes - Union-find.
Write down some notes to help yourself to understand better in theory. Algorithm is not just to write a program, also need to understand the problem more thoroughly.
Actionable Items:
Julia had some difficulty to understand the union-find algorithm, therefore, she moved on her next search, not by Google.
From January 2015, she started to practice leetcode questions; she trains herself to stay focus, develops "muscle" memory when she practices those questions one by one. 2015年初, Julia开始参与做Leetcode, 开通自己第一个博客. 刷Leet code的题目, 她看了很多的代码, 每个人那学一点, 也开通Github, 发表自己的代码, 尝试写自己的一些体会. She learns from her favorite sports – tennis, 10,000 serves practice builds up good memory for a great serve. Just keep going. Hard work beats talent when talent fails to work hard.
No comments:
Post a Comment