I like the ways this guy thinks.
“
習慣的思考模式是演繹 -> 歸納 -> 演繹 -> 歸納（簡稱為演繹 -> 歸納螺旋丸），不斷迂迴深入直到想出解法。
“
I like to do it first, analyze, and keep doing ……
In the beginning, I study from questions which designed by LeetCode.
Until solving 100 problems, I know some patterns.
I turned back to summarize those problems.
Then I keep doing ……
https://blog.techbridge.cc/2020/07/05/leetcode-pattern-anniversary/
https://po-jen-lai.gitbook.io/coding-practice-advanced-topics/
C/C++
|Algo| Recursion
I watched a two pointer video,
but I thought its recursion is better.
|Algo| Trie
Trie is a tree structure.
Usually, it is used to solve the dictionary problems.
|Algo| Breadth-First Search
Breadth-First Search, BFS.
It is a common algorithm applied on graph problems !!
|Algo| Topological Sort
In fact, Topological Sort is a BFS.
It is to solve the question which should list all path of graph.
But there are some conditions which users should understand.
