摘要：
A simple greedy construction procedure: - Fill out the seq of 'I' with 0, 1, 2, 3... - Similarly, for the seq of 'D', fill it out with n, n - 1, n - 2 阅读全文
摘要：
I have average IQ so even after reading several articles on Paxos, I was still confused. Then I found this presentation from Google - it is just 20-is 阅读全文
摘要：
A very clear article (in zh-cn) on the topic (as in the title) - http://www.hollischuang.com/archives/681 Key take-aways: 二阶段提交的算法思路可以概括为：参与者将操作成败通知协调 阅读全文
摘要：
http://datastrophic.io/resource-allocation-in-mesos-dominant-resource-fairness-explained/ Original paper at: https://people.eecs.berkeley.edu/~alig/pa 阅读全文
摘要：
As a Distributed System rookie, it is very helpful to glance over AWS WhitePaper, to get a better understand to the horizon of the #1 Cloud Computing 阅读全文
摘要：
It is not a hard one, but I still learnt a good lesson on how to optimize my strategy. My first thought was on the right track: do a O(n) scan and do 阅读全文
摘要：
I found this super helpful and hands-on tutorial on basics about Apache Spark, and also step-by-step user guide - I enjoyed it a lot. 倾情大奉送--Spark入门实战 阅读全文
摘要：
Just finished watching all videos of this course - thank you Andrew for elaborating all basic ML concepts\algorithms in an easy to understand way. I w 阅读全文
摘要：
1AC - Yay! A super cute one : ) Again, simulate & play with it in your mind, and you will get it. Key: for car[i] at its position, it can only pass th 阅读全文
摘要：
https://www.amazon.com/Introduction-Linear-Algebra-Gilbert-Strang/dp/0980232775/ Went through 85%-90% of this book on BART.. as my step 2 to learn Mac 阅读全文
摘要：
https://classroom.udacity.com/courses/st101 An undergrad Stat course refresher - as my 1st step to learn ML. 阅读全文
摘要：
The latest article from InterviewCake is about a very neat & elegant algorithm: Fisher-Yates shuffle algorithm Q: how to shuffle an array - in-place? 阅读全文
摘要：
This is a super fun problem to think. Again - let's bring our ultimate tool to start playing with it - DISCRETE THINKING, STEP BY STEP. 1. [3,2] is tr 阅读全文
摘要：
It is a super interesting problem - it's not about the algorithm SKILLs, it is about algorithm THINKING. In this problem, the goal is actually to have 阅读全文
摘要：
Interesting constructive solution. My first reaction was 0-1 Knapsack and I believe it'll work. But you don't have to use it. Think about the min sum 阅读全文
摘要：
Key points for this one: - Relate the comparison process to BST search- Reasoning on extreme values: "We can notice that for a fixed the maximum sum o 阅读全文
摘要：
Key point of this problem is "New subsets are the all old subsets having a[i]." - A very useful trick. After that, it'll simply be a DP one. 阅读全文
摘要：
This is an educational one to Game Tree + Minimax - sounds fancy but actually it is intuitive DFS process. And Simplified Chess Engine II is an variat 阅读全文
摘要：
Fancy, classic, STEP-BY-STEP Analysis strategy problem. Here is the approach: 1. Sort input arrays.. so sum[0] is a[0] * k, so we got a[0]2. Then who 阅读全文
摘要：
Classic problem to learn Game Theory - an advanced one: how to identify sub-games.. For every move (hit 1\2 bins) on one continuous section, the origi 阅读全文