Tonix - 博客园

LeetCode 942. DI String Match

摘要： 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 阅读全文

posted @ 2018-12-18 13:18 Tonix 阅读(131) 评论(0) 推荐(0)

Understanding Paxos Algorithm

摘要： 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 阅读全文

posted @ 2018-09-24 11:33 Tonix 阅读(107) 评论(0) 推荐(0)

Distributed Transaction, 2-Phase Commit, 3-Phase Commit

摘要： A very clear article (in zh-cn) on the topic (as in the title) - http://www.hollischuang.com/archives/681 Key take-aways: 二阶段提交的算法思路可以概括为：参与者将操作成败通知协调阅读全文

posted @ 2018-09-24 07:23 Tonix 阅读(117) 评论(0) 推荐(0)

Mesos Resource Allocation Algo: DRF(Dominant Resource Fairness)

摘要： http://datastrophic.io/resource-allocation-in-mesos-dominant-resource-fairness-explained/ Original paper at: https://people.eecs.berkeley.edu/~alig/pa 阅读全文

posted @ 2018-09-22 07:18 Tonix 阅读(137) 评论(0) 推荐(0)

AWS Whitepaper

摘要： 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 阅读全文

posted @ 2018-09-06 10:53 Tonix 阅读(184) 评论(0) 推荐(0)

HackerRank - Minimum Swaps 2

摘要： 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 阅读全文

posted @ 2018-09-01 04:32 Tonix 阅读(484) 评论(1) 推荐(0)

Spark Tutorial recommended

摘要： 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入门实战阅读全文

posted @ 2018-08-28 12:54 Tonix 阅读(120) 评论(0) 推荐(0)

[Checked (vid only)] Cousera - Machine Learning by Andrew Ng

摘要： 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 阅读全文

posted @ 2018-07-16 12:47 Tonix 阅读(127) 评论(0) 推荐(0)

LeetCode 853. Car Fleet

摘要： 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 阅读全文

posted @ 2018-06-18 11:58 Tonix 阅读(195) 评论(0) 推荐(0)

[Checked] Introduction to Linear Algebra

摘要： 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 阅读全文

posted @ 2018-05-28 06:06 Tonix 阅读(341) 评论(0) 推荐(0)

[Checked] Udacity - Intro to Statistics

摘要： https://classroom.udacity.com/courses/st101 An undergrad Stat course refresher - as my 1st step to learn ML. 阅读全文

posted @ 2018-05-28 06:04 Tonix 阅读(100) 评论(0) 推荐(0)

Fisher-Yates shuffle algorithm

摘要： The latest article from InterviewCake is about a very neat & elegant algorithm: Fisher-Yates shuffle algorithm Q: how to shuffle an array - in-place? 阅读全文

posted @ 2018-02-15 05:45 Tonix 阅读(196) 评论(0) 推荐(0)

775. Global and Local Inversions

摘要： 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 阅读全文

posted @ 2018-02-02 14:10 Tonix 阅读(91) 评论(0) 推荐(0)

HackerRank "Yet Another KMP Problem" !! wow

摘要： 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 阅读全文

posted @ 2018-01-27 07:35 Tonix 阅读(221) 评论(0) 推荐(0)

HackerRank "Bonetrousle"

摘要： 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 阅读全文

posted @ 2018-01-27 06:25 Tonix 阅读(155) 评论(0) 推荐(0)

HackerRank "Lena Sort"

摘要： 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 阅读全文

posted @ 2018-01-16 13:53 Tonix 阅读(180) 评论(0) 推荐(0)

HackerRank "Shashank and List"

摘要： 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. 阅读全文

posted @ 2018-01-16 10:57 Tonix 阅读(118) 评论(0) 推荐(0)

HackerRank "Simplified Chess Engine I & II"

摘要： 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 阅读全文

posted @ 2018-01-15 14:22 Tonix 阅读(162) 评论(0) 推荐(0)

HackerRank "Repetitive K-Sums" !!!

摘要： 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 阅读全文

posted @ 2017-12-30 03:55 Tonix 阅读(239) 评论(0) 推荐(0)

HackerRank "Bowling Pins" !!! [Game Theory]

摘要： 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 阅读全文

posted @ 2017-12-29 13:17 Tonix 阅读(256) 评论(0) 推荐(0)

Tony's Log

公告