Dec. 11, 2016
Introduction
Array construction is the first advanced algorithm Julia tried to work on in the contest, she did try to work on over 10 hours, but she scored 0 (maximum score 80). Through the contest, she started to understand the algorithm and built up strong interest in problem solving.
Later, she read one of solution, and then, spent over 4 hours to understand the pruning idea to avoid timeout issue.
Later, she did very intensive research on recursive function. But, she needs to get it on stackexchange.com, share her interest and questions, and then, see if she will get any surprise. Success after team work, Julia likes to practice the belief.
Previous blogs about the algorithm:
Labels: Array Construction (Series 1 of 5)
http://juliachencoding.blogspot.ca/2016/11/hackerrank-codesprint-array.html
Workout:
Plan to post a question on stackoverflow.com code review for code review.
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.
Showing posts with label stackexchange code review. Show all posts
Showing posts with label stackexchange code review. Show all posts
Sunday, December 11, 2016
Sunday, November 27, 2016
Stackoverflow - code review research
Nov. 27, 2016
Try to post the first code review on code review on stack exchange, code review section.
When I try to put the title:
Leetcode 329 Longest Increasing Path in a matrix - DFS, memorization
Here are information coming out.
Questions that may already have your answer
Review the above entries.
So many to read and so good the experience is. Cannot wait to spend time on those posts. Julia knows that it is time to make changes, her research usual touched the surface only.
For example, with stackexchange code review, her research from Nov. 30 posting the question to a perfect solution (Dec. 2, 2016) on Java TreeSet class floor method and its analog in C# ends up working code - SortedSet GetViewBetween, score maximum score. It takes less than 3 days to find a practical solution, with two experts' help.
Blog reading:
Bear and steady gene - C# algorithm:
https://gist.github.com/jianminchen/153eab0defae014842e8
Try to post the first code review on code review on stack exchange, code review section.
When I try to put the title:
Leetcode 329 Longest Increasing Path in a matrix - DFS, memorization
Here are information coming out.
Questions that may already have your answer
Review the above entries.
So many to read and so good the experience is. Cannot wait to spend time on those posts. Julia knows that it is time to make changes, her research usual touched the surface only.
For example, with stackexchange code review, her research from Nov. 30 posting the question to a perfect solution (Dec. 2, 2016) on Java TreeSet class floor method and its analog in C# ends up working code - SortedSet GetViewBetween, score maximum score. It takes less than 3 days to find a practical solution, with two experts' help.
Blog reading:
Bear and steady gene - C# algorithm:
https://gist.github.com/jianminchen/153eab0defae014842e8
Subscribe to:
Posts (Atom)