2018背水一战

计划是每天十道题加上学习新知识，每周投20+

楼主加油！也鼓励自己。没有intern experience，面临5月份毕业，压力好大。只能咬牙坚持了。

127. Word Ladder (M)
BFS Queue
130. Surrounded Regions (M)
O(m*n)
131. Palindrome Partitioning (M)
DFS backtracing
128. Longest Consecutive Sequence (H)
When merge the range with new node, only the end of the range should be tracked. If node is in the range, the hashmap would already have the node. O(n)
124. Binary Tree Maximum Path Sum (H)
Do it second time. Consider helper return the single branch sum and get the max sum.
123. Best Time to Buy and Sell Stock III   (H)
Save the profit at each buy and sell time.
126. Word Ladder II (H)
无向图 -> BFS -> 树 -> DFS -> 结果
133. Clone Graph (M)
DFS with hashmap recording visit
134. Gas Station (M)
In range i...j if sum(i, j) > 0 and sum(i,k) < 0, it means sum(i+1, k) < 0. So we can start trying at k+1.
136. Single Number(E)
Use Xor operation.

Today's coding practices:

Maximum Depth of Binary Tree
Construct Binary Tree from Preorder and Inorder Traversal
Construct Binary Tree from Inorder and Postorder Traversal  
Binary Tree Level Order Traversal II  
Convert Sorted Array to Binary Search Tree  
Convert Sorted List to Binary Search Tree
Balanced Binary Tree
Minimum Depth of Binary Tree
Path Sum
Path Sum II

Learned about parallel computing on coursera. Start on mini project.

握爪 计划一致啊 加油加油

加油啊！ 我觉得可行！建议楼主把这些指标写出来，我发现写出来会很powerful，让你必须做完

谢谢各位的鼓励，今年有点难，大家一起加油吧

Sqrt(x) II
LRU
Minstack
Flatten Nested List Iterator
Insert Delete GetRandom
MaximumDistanceTwoWords
SumLinkedList
Recover Binary Search Tree (不会)
Same Tree
Symmetric Tree

累觉不爱。。

Flatten Binary Tree to Linked List(M) √
Distinct Subsequences
Populating Next Right Pointers in Each Node
Populating Next Right Pointers in Each Node II
Pascal's Triangle
Pascal's Triangle II
Triangle
Best Time to Buy and Sell Stock
Best Time to Buy and Sell Stock II
Sum Root to Leaf Numbers

Scramble String
Candy
Palindrome Partitioning II
Sibgle Number II
Copy List with Random Pointer
Word Break
Word Break II
Reorder List
不行了，感觉眼花的要看不见了T T

hard 题目真的好难。。有时候就是脑子绕不出来，刷一下午题感觉自己跟死鱼一样了