代码随想录 LeetCode Master: LeetCode Algorithm Study Guide
/leetcode-master
代码随想录 LeetCode Master is a Chinese-language repository that turns LeetCode grinding into a fixed 200-problem curriculum, complete with diagrams, video breakdowns, and code in five languages. Reach for it if you read Chinese and want someone else's judgment call on which problems matter and in what order. Skip it if you need English write-ups, since the explanations, community group, and PDF signup are all Chinese-first.
About Code Thinking LeetCode Master
代码随想录 LeetCode Master is a study repository built around a curated sequence of 200 classic LeetCode problems, grouped by data structure and algorithm topic instead of left as a flat list. Each problem gets a diagram-heavy written explanation plus a video walkthrough for the trickier points. The README puts the total explanatory text at roughly 600,000 characters, spread across more than 50 mind maps.
Who This Guide Is For
代码随想录 LeetCode Master suits developers preparing for coding interviews who read Chinese and want a fixed problem order instead of building their own study plan from scratch. It also fits anyone moving from basic data structures into harder ground like backtracking, dynamic programming, or graph algorithms, since every topic opens with a theory page before the problems. Skip it if you need English-language write-ups throughout, since the explanations, video course, and study group are all Chinese-first even though the reference code spans five languages.
Key Features and Content
- ✓A 200-problem sequence grouped into topics: Array, Linked List, Hash Table, String, Two Pointers, Stack and Queue, Binary Tree, Backtracking, Greedy, Dynamic Programming, Monotonic Stack, and Graph Theory, rather than an alphabetical or difficulty-only list.
- ✓Each topic opens with a theory primer, such as a binary-tree fundamentals page, before the individual problems, and closes with a recap page that ties the section together.
- ✓The dynamic programming topic splits further into knapsack problems (01, complete, and multiple knapsack variants), house-robber problems, stock-trading problems, and subsequence problems, each with its own recap.
- ✓Graph theory covers DFS and BFS basics, union-find, topological sort, Dijkstra in both naive and heap-optimized form, Bellman-Ford with SPFA queue optimization, Floyd, and A*.
- ✓Explanations are written primarily in C++, with community-contributed code in Java, Python, Go, and JavaScript alongside the main write-up.
- ✓A separate algorithm-templates document collects reusable code patterns outside the main problem sequence.
- ✓A linked 170-episode video course on Bilibili walks through the material for readers who prefer watching to reading.
- ✓Written by an author identified as Carl, a Harbin Institute of Technology graduate who worked backend and infrastructure roles at Tencent and Baidu before writing the companion book.
Why Choose This LeetCode Guide
- ✓A fixed problem order removes the decision fatigue of picking what to grind next on LeetCode.
- ✓Each problem combines a diagram, written text, and video, rather than relying on one format alone.
- ✓The topic recap pages reinforce what a section covered instead of ending on the last problem.
- ✓Dynamic programming and graph theory get genuinely deep subseries, not just a single-page overview of each topic.
- ✓Multi-language code extends the write-ups past a C++-only audience.
Potential Limitations
- △This is a Chinese-first resource.
- △The companion book is sold through a JD.com purchase link rather than offered as a free download in the repository.
- △The PDF explanations aren't a direct download; the README asks readers to add a WeChat contact first.
- △GitHub lists no license for the repository. The README's own copyright notice says reproduction requires attribution and threatens legal action against unauthorized copying, so reuse terms are stricter than a typical open-source license.
- △The weekly recap file names in the table of contents carry dates from 2020 into 2021. Nothing in the README indicates the problem set has been extended since, so how current it is isn't clear from what's documented here.
Alternatives for Algorithm Practice
Frequently Asked Questions
代码随想录 LeetCode Master explains problems primarily in C++, with community-contributed solutions in Java, Python, Go, and JavaScript, according to the README.
代码随想录 LeetCode Master has a companion book, 《代码随想录》, linked from the README through a JD.com purchase page rather than offered as a free download.
代码随想录 LeetCode Master accepts solution revisions, additional language implementations, documentation fixes, and new practice problems. The README points contributors to a separate contribution guide.
代码随想录 LeetCode Master states in its README that all content is original, that reuse requires crediting the source, and that unauthorized reposting or rewriting will be pursued legally.
代码随想录 LeetCode Master's README says to add the project's WeChat account to receive the PDF explanations automatically, with an option to join a companion study group.
代码随想录 LeetCode Master recommends beginners start with Array, Linked List, Hash Table, and String topics before moving on to Binary Tree, Backtracking, Greedy, Dynamic Programming, and Graph Theory, per the README's suggested order.
Best use cases
- •Studying algorithm interview problems in a set order instead of picking from an unordered LeetCode list.
- •Working through dynamic programming systematically, using the knapsack, house-robber, stock-trading, and subsequence subseries as a ladder from easy to hard.
- •Porting solutions into Java, Python, Go, or JavaScript by referencing the community-contributed implementations alongside the primary C++ write-ups.
- •Reviewing time and space complexity fundamentals before starting the problem sets, via the intro section on algorithm performance analysis.
Related repositories
Is leetcode-master worth your time?
ChatGPT, Claude and Perplexity can all read this page. Ask one of them what it makes of leetcode-master.