[第二期活动] 在职刷题打卡，目标工作日一天2题，周末一天5题

day 8
今日5题
Integer to English Words 繁琐没什么意义的hard
Shortest Palindrome 感觉很难，其实反转一下字符串然后前后比较直到找到最长Palindrome，再把剩余的贴前面就ok，写起来就三四行
Palindrome Permutation II backtracking
Palindrome Permutation 双指针
Fizz Buzz 水个高频easy。。。

#Day_10

Finished * 2 Graph
133. Clone Graph
269. Alien Dictionary

读了System Design Interview - An insider's guide第二章，讲的是如何设计一个consistent hashing帮助evenly distribute keys，主要思路是利用环状hashing以及virtual nodes将keys均匀地分布到各个server，环状结构可以确保增删server时开销为k/n（这是modular hashing的缺点），足够多的virtual nodes可以使得key更均匀地分布到每个server。感觉这本书就是骗钱的。

#Day_01
#102 Binary Tree Level Order Traversal using either recursion or iteration. call the helper function with the current node and current level as parameters
#107 Binary Tree Level Order Traversal II print the level order in a reverse way. You can either use the recursive or iterative function. It is pretty much the same as the question before just change the order.

Day_08
1. Mostly solved by two pointer, 11 (the widest container usually contains the max vol of water), 92, 206, 234, 28 (Rabin-Karp, esp how to do hash, and how to remove the characters from the hashing), 283, 344
2. 56 merge intervals, sort, curr start and curr end
3. 289 game of life, introduce two extra states in order to do in place
4. Tree traversal, 289=530, 94, 144, 145, 102, 107, 103 (the order of how the value is added is zigzag), 314 (the key is how to index the node, set the root to have col_index of 0, and its left child has x - 1, and its right child has x + 1)

Sato123 发表于 2019-8-12 07:46
#Day_10

Finished * 2 Graph

厉害呀，目前第一名！
这个书感觉听起来还不错？是买的电子版么

day 9
今日4题
Palindrome Partitioning II 在这题上耗去了大半天，没有解释的好又简洁的，自己理解总结很费时
Reorder Log Files
Combine Two Tables
Time Based Key-Value Store

day 4 day 5

Design Yelp

Algorithm
1. Day of Year
2. Course Schedule
3. Course Schedule II
4. Combinations
5. Combination Sum
6. Combination Sum II
7. Combination Sum III
8. Generate Parentheses

xsijg8 发表于 2019-8-12 13:20
厉害呀，目前第一名！
这个书感觉听起来还不错？是买的电子版么

没办法，pay back以前做的错误决定。不过养成习惯后现在每天2题不太消耗will power了，只是耗时间。

实体版。这书感觉不行，只不过已经读了快2/3了，打算把它看完。

Day 2
Intersection of Two Arrays
Intersection of Two Arrays II and follow up

#Day_01

1110 Delete Nodes And Return Forest
774        Minimize Max Distance to Gas Station
846        Hand of Straights
911        Online Election