每天刷->700题战拖 - From Nov 28, 2017

在职刷,每天10+题.  尽情监督, 漏一天发红包10刀.


Nov 29 - 2017
46: permutations
191: number of 1 bits
200: number of islands
338: counting bits
458: poor pigs
461: hamming distance
463: Island perimeter
695: max area of island




补充内容 (2017-12-12 06:08):
尽情star我的repo: https://github.com/fxrcode/LeetJ8

Nov 30, 2017
14. Longest Common prefix
20. Valid Parantheses
78. Subsets
139. Word Break I : TLE (DFS的做法)
191. Decode ways I
130. Surrounded regions
127. Topological sorting
534. Design TinyURL

面试题
1. Rejection sampling
2. Eventual perfect Failure Detector in Scala
3. Find cluster (`int findCluster(List<DLLNode> nodes)`. 输入是一个list的双向链表上的一些节点, 求能组成几个cluster)
4. Find Cluster II (原来Tarjan也在HP lab)

还和同事讨论了一个智力题: problem of 2 eggs. 100层楼扔2个鸡蛋找到碎与不碎的临节点的worse case次数. 不过还没理解min{max{...}}的策略树解法.

Dec 9, 2017
补一下之前落下的进度. 今天做九章chapter 6-Graph Search - DFS/BFS的例题.
## 089 - Gray Code
## 078 - Subsets
## 131 - Palindrome Partitioning
## 039 - Combination Sum I
## 040 - Combination Sum II
## 216 - Combination Sum III
## 377 - Combination Sum IV

Dec 5, 2017

76. Minimum Window Substring
141. Linked List Cycle
160. Intersection of Two Linked Lists
173. Binary Search Tree Iterator
606. Construct String from Binary Tree   
632. Smallest Range
656. Coin Path

Lintcode
201. Segment Tree Build

加油，向楼主学习！这种精神太重要了

突然想转发楼主的头像，求好运
lz加油

太厉害了，每天需要多长时间刷完10+题呀？

Dec 1, 2017

91: Decode Ways: 记忆化DFS. 今天在理解这个, 花了挺久.
362. Design Hit Counter. 谢谢地里Dropbox的详细面经. 全是设计题, 而且要熟练DB.
534. Design TinyURL. play框架+redis+postgreSQL.

Dec 2, 2017

Union Find template with weighted union and path compression.
SCC with KosarajuSharir algs
working on  eventually perfect failure detector.
...

赞楼主！

Dec 3, 2017

51. N-Queens
146. LRU Cache
190. Reverse Bits
359. Logger rate limiter
443. String Compression - Google电面题
503. Next Greater Element 2xx. 2个鸡蛋问题. DP解法

Dec 4, 2017

53. Maximum Subarray
152. Maximum Product Subarray
401. Binary Watch
621. Task Scheduler
543. Diameter of Binary Tree  
100. Same Tree
212. Word Search II