01. Sliding Window & Two Pointers (滑動視窗與雙指針)
Fixed-length and variable-length windows, opposite-direction pointers, three pointers, and subarray counting invariants.
2,300+ Rated LeetCode Problems · 十二份系統化演算法與資料結構題單
12 Structured LeetCode Algorithm Study Plans
Stop grinding random problems without a roadmap. Dokicode organizes over 2,300 LeetCode problems (inspired by EndlessCheng's taxonomic problem lists and calibrated with Zerotrac contest ratings) into 12 progressive study plans across two tracks, complete with section pattern summaries and 4-step progressive hints.
告別盲目隨機刷題。Dokicode 將超過 2,300 道 LeetCode 題目按演算法套路與 Zerotrac 競賽難度分級，整理為兩大軌道、十二份循序漸進的系統化題單，每個章節皆附帶核心套路講解與四階段漸進提示。
Open Study Plans in Dokicode →Track 1 — Iterative & Core Foundations (免遞迴基礎與核心套路軌)
02. Binary Search (二分搜尋演算法)
Lower/upper bound templates, binary search on answer (min-max / max-min), kth-smallest search, and monotonic predicates.
03. Monotonic Stack & Queue (單調堆疊與單調佇列)
Next greater element, histogram rectangles, contribution counting, monotonic deque sliding extrema, and lexicographical stacks.
04. Core Data Structures (常用資料結構)
Prefix sums, difference arrays, hash maps, heaps/priority queues, Union-Find (DSU), Trie, Fenwick tree (BIT), and Segment Trees.
05. Bit Manipulation (位元運算與集合論)
XOR properties, lowbit tricks, subset enumeration, bitwise contribution, and linear basis fundamentals.
06. Greedy & Constructive Algorithms (貪心與構造演算法)
Interval scheduling, exchange arguments, median inequality, regret heaps, and constructive permutations.
07. Mathematics & Number Theory (數學、數論與組合學)
Prime sieves, GCD/LCM, modular arithmetic, combinatorics, inclusion-exclusion, probability, and game theory.
08. Strings & Automata (字串演算法與自動機)
KMP, Z-function, Manacher palindrome search, rolling string hashing, and Aho-Corasick trie automata.
Track 2 — Recursion, Trees, DP & Graphs (遞迴、樹、動態規劃與圖論進階軌)
09. Linked Lists, Trees & Backtracking (鏈結串列、二元樹與回溯)
Fast/slow pointers, tree DFS/BFS, LCA, tree diameter, subset/permutation/combination backtracking, and pruning.
10. Grid & Matrix Algorithms (網格圖 DFS / BFS)
Connected components on grids, multi-source BFS, 0-1 BFS, Dijkstra on weighted grids, and flood fill.
11. Dynamic Programming (動態規劃全專題)
Linear DP, 0-1 & unbounded knapsack, interval DP, state-machine DP, tree DP, bitmask DP, and digit DP.
12. Graph Algorithms (圖論演算法)
DFS/BFS traversal, topological sort, Dijkstra, Bellman-Ford, Floyd-Warshall, Kruskal/Prim MST, bipartite matching, and network flow.