algorithm-base
Chinese-language animated explanations of algorithms and LeetCode-style interview problems, written as Markdow
- Stars
- 10.7k
- Forks
- 1.5k
- Licence
- MIT
- Language
- —
- Last update
- 1.5 years ago
- Type
- Learning resource
No commits in over a year — check for forks or alternatives before adopting.
What it is
This is a collection of study notes, mostly in Chinese, that explain data structures and algorithms such as hash tables, linked lists, trees, sorting, and string matching using step-by-step animations and diagrams. It also groups LeetCode and Jianzhi Offer interview problems by topic, with each problem linked to its own write-up. It is meant for people preparing for technical interviews who want visual explanations rather than just code.
- Read the animated explanation of KMP or BM string matching before an interview
- Study sorting algorithms such as quicksort and heap sort through their animated walkthroughs
- Work through LeetCode problems grouped by topic, such as array problems like Two Sum
- Review binary tree traversals, including iterative and Morris versions
Great for
- Chinese-speaking developers preparing for coding interviews
- Students learning data structures through visual walkthroughs
- Readers who prefer step-by-step diagrams over dense textbook text
Not ideal for
- Readers who do not read Chinese, since the README and linked notes are in Chinese (reason: language barrier)
- People looking for runnable software or a library to install (reason: this is a set of reading materials, not a program)
How to get it
- 1
Read it online
Clone the repository to read the notes locally
git clone https://github.com/chefyuan/algorithm-base - 2
Run it
- Open https://www.chengxuchu.com, which the README recommends for more stable online reading
- Or clone the repository and open the animation-simulation folder
- Pick a topic such as sorting or binary trees and read the linked note
- Work through the related LeetCode problems listed in the same section
- 3
Get the most out of it
- Start with the data-structure prerequisites (hash tables, stacks and queues, linked lists) before the algorithm sections
- Use the sorting section alongside the sorting-related interview problems in the 排序算法秒杀题目 section
- Read the Morris traversal notes after the basic iterative traversals to compare approaches
- Check the README for the WeChat and Zhihu links if you want updates from the author
Downloads
Strengths
- Uses animations and diagrams to explain algorithms step by step
- Organizes problems by topic, from prerequisites to specific LeetCode questions
- Free and MIT-licensed, so the material can be reused under those terms
Trade-offs
- Most of the content is in Chinese, which limits its audience
- The README is truncated in this data, so the full list of topics is not confirmed here
- Written as an interview-prep resource, so it does not teach a programming language or runnable project
How it compares
| Project | Stars | Type | Level | Updated | Best for |
|---|---|---|---|---|---|
| algorithm-base (this) | 10.7k | Learning resource | beginner | 1.5 years ago | Chinese-speaking developers preparing for coding interviews |
| interviews | 65.5k | Learning resource | beginner | 1.5 years ago | Students preparing for their first software engineering interviews |
| tech-interview-handbook | 143k | Learning resource | beginner | 3 months ago | Engineers preparing for technical interviews who have limited study time |
| LeetCode-Go | 33.8k | Learning resource | beginner | 25 days ago | Developers practicing LeetCode problems in Go |
| The-Complete-FAANG-Preparation | 12.3k | Learning resource | beginner | 25 days ago | Students preparing for technical software engineering interviews |
| javascript-algorithms | 197k | Learning resource | beginner | 3 months ago | Students learning core computer science concepts in JavaScript |
Stats synced from GitHub. The assessment above was drafted with AI from the project's README on 2026-10-29 and may miss recent changes — check the README before relying on a command. MIT licence: free to use, modify and distribute, including commercially, as long as you keep the copyright notice.