LeetCode Practice
- DFS based on recursive needs high memory cost, publicly used in tree and permutation problems.
- DP based on the transfer function, in which the problem need to compute the number of different outcome.
- I so far pratice about 120 problems which are excact in easy and medium degree.
- Timeline: 4, June