Dec. 25, 2016
Introduction
A few of facts about the algorithm:
1. In contest, spent over 10 hours to work on
2. The algorithm is advanced one
3. Score 8 out of 80
4. The algorithm is really a challenging one
5. Spent over 10 hours to work on after the contest, studied C# code
http://juliachencoding.blogspot.ca/search/label/array%20construction%20%28series%201%20of%205%29
Workout
1. Plan to write a code review request on stackexchange.com.
2. Need to study how to post a good code review on stackexchange.com
3. Be careful that do not get down vote, off-topic
4. Put down ideas why to ask code review
5. Julia also learned through the code review, how to write better English, her grammar mistakes.
Code Review Link
Case study:
http://meta.codereview.stackexchange.com/a/1035/123986
http://meta.codereview.stackexchange.com/users/11974/user1131146-account-abandoned
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 cache design. Show all posts
Showing posts with label cache design. Show all posts
Sunday, December 25, 2016
Thursday, June 25, 2015
Cache design, dynamic programming - matrix region sum
June 25, 2015
Introduction
It is my firs time to read the algorithm and I am so surprised to learn the algorithm. I love the learning and also very happy to read the blog with good and very clear explanation of the algorithm.
Problem statement:
Problem statement:
Given the integer matrix, top left and bottom right coordinates of the rectangular region, calculate the region sum.
Here is one of blogs I like to read and share.
Make it more time efficient
Naive solution, O(n x m) calculation of addition to get the sum. How to get it as O(1) using cache, how big the cache space?
Naive way to design the cache, it takes O( n2 x m2) space. The efficient way is O(n x m), using dynamic programming.
Share the practice C# code, here is the link.
Tuesday, June 9, 2015
Algorithm blog - 30 questions
April 26, 2015
Spent over a few months to go over 30 questions about algorithm starting from January 13, 2013. 网站很好, 看看, 有些帮助.
Some of questions are my favorites ones.
印象最深的是这道题目: (Most memorized example:)
Later, in website administration, IIS cache configuratuion, another important lesson learned is to set up time to refresh the cache. That is also an important thing to keep people informed how refresh the content on the web page. Personally, I designed a simple cache with time expiration 60 seconds on the website.
总之, 做题对工作有些帮助, 但是, 还是有很多设计, 需要进一步的去了解, 实际情况更复杂. 象网页图片, 内容的更新, 关心的是网页多久更新一次, 不仅是用不用Cache.
从1998年计算机硕士生毕业, 博士学习很多年, 慢慢开始训练自己算法和数据结构, 一定要多看, 多写, 多犯错, 才有提高. 我还在碰到新问题, 紧张得不行, 不知道如何解决的阶段.
Subscribe to:
Posts (Atom)