# ¶ Graduation

{% hint style="success" %}

#### 完成 RCS.101 後

* [ ] 所有 [](https://republic-of-cs.gitbook.io/e/rcs.101 "mention") 主題有涵蓋的 LeetCode Easy，都有能力解出來。
* [ ] 所有 [](https://republic-of-cs.gitbook.io/e/rcs.101 "mention") 主題有涵蓋的 LeetCode Medium 題目，都有能力至破題，**辨認出自身缺乏的任何 DSA 新知，並找出題目來自主練習。**
  {% endhint %}

{% hint style="info" %}

#### rcs.101.ω

> 此模組存放了一系列結合 [](https://republic-of-cs.gitbook.io/e/rcs.101 "mention") 各經典主題的延伸應用，這些延伸應用題目可能會比較 tricky，但和經典的 real-world problem 都有所連結，因此我們將其整理在這。

> 若寫不出來也不用灰心，因為其中的概念都已在 [](https://republic-of-cs.gitbook.io/e/rcs.101 "mention") 有完整練習了。若想在 「演算法解題」 上能更近一步地去突破，我們會推薦採納 [rcs.102](https://republic-of-cs.gitbook.io/e/rcs.102 "mention")

* [ ] **M** [**1472. Design Browser History**](https://leetcode.com/problems/design-browser-history/)
* [ ] **H** [**297. Serialise and Deserialise Binary Tree**](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)
* [ ] **H** [**736. Parse Lisp Expression**](https://leetcode.com/problems/parse-lisp-expression/)
* [ ] **H** [**1106. Parsing A Boolean Expression**](https://leetcode.com/problems/parsing-a-boolean-expression/)
* [ ] **H** [**630. Course Schedule III**](https://leetcode.com/problems/course-schedule-iii/)
  {% endhint %}

{% hint style="info" %}

#### rcs.101.ψ

* [**MST (Minimum Spanning Tree)**](https://leetcodethehardway.com/tutorials/graph-theory/kruskals-algorithm)
  * [ ] **(Kruskal's Algorithm)**
  * [ ] [**Ackermann Function**](https://www.youtube.com/results?search_query=ackermann+function)
  * [ ] **M** [**3672 · Connecting Cities With Minimum Cost**](https://www.lintcode.com/problem/3672/description?_from=problem_tag\&fromId=399)
    {% endhint %}