Nov. 7, 2016
Problem statement:
https://www.hackerrank.com/contests/ncr-codesprint/challenges/super-valid-bracket-sequences
Julia spent over 2 hours to do some research, work on a simple problem using code, figure out the size T(n), and also came out the formula of recurrence.
Here is her code for prototype work:
https://gist.github.com/jianminchen/d27a0c1b5d7b366903b4c25408d25269
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.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment