每天5 - 10题复习（都是之前刷过的题，复习+总结）

Day 1 Memoization Search & DP今天下午和同事讨论project，讨论之前先做五题。
107 Word Brk
One demention list [TFFFFFF...], get the maximum length of words in the dict, iterate i: 1...length + 1, j: min(i, maxLen) + 1, i stands for the last index os substring, j stands for the length of sub string, f[i-j] stands for the last index value result of last sub.
store result of s[i-j:i] in dict to the list of result.

582 WB II
This is finding the examples, so using dfs.

683 WB III






补充内容 (2019-8-4 02:36):
divide and conquer + DFS, memoization.

补充内容 (2019-8-4 09:09):
Set dict and store the process of changes into the dict.
109, 192, 154

Day 4
Minimax, Expectimax, and Utilities (AIMA, 5.2-5.5 and 16.1-16.3)
Markov Decision Processes (AIMA, 17.1-17.3 and Sutton and Barto, Chapter 3)
Reinforcement Learning (AIMA Chapter 21 and Sutton and Barto, 6.1, 6.2 and 6.5)
Markov Models and Probability (AIMA 13.1-13.5 and 15.2-15.5)

Day 5
Bellman equation
Value iteration algorithm
Markov Models and Probability (AIMA 13.1-13.5 and 15.2-15.5)
Bayes' Nets (AIMA 14.1, 14.2, 14.4)
Neural Networks (Michael Nielsen Chapter 1 and 2)

Day 3
1592. Find and Replace Pattern
Construct related dictionary / hash table to store the relationship between patterns.

补充内容 (2019-8-7 01:33):
Pull/Push Model
Longest Increasing Subsequence related problems

加油哦 学习一下

DP & Coordinate DP
110, 111, 112, 113, 114, 115

补充内容 (2019-8-5 04:16):
Inside of Col #, outside of Row #
Largest Divisible Subset:
    def largestDivisibleSubset(self, nums):
        # Write your code here
        n = len(nums)
        dp = [1] * n
        father = [-...

补充内容 (2019-8-6 01:34):
Day 2

Day 6
Graph
35, 36 linked list

补充内容 (2019-8-12 02:23):
linked list cycle
merge k sorted / news pull model system

Ladder practice.
Gridy


补充内容 (2019-8-13 22:57):
Day 7
CNN, Mean/Max pooling

加油，我也在尝试这样子记录

LauraInUS 发表于 2019-8-13 09:20
加油，我也在尝试这样子记录

哈哈哈 给自己一点儿动力 一起加油！