// the find
algorithmzuo/algorithm-journey
左程云的算法和数据结构通关课
A structured algorithms and data structures course by Chinese educator 左程云 (Zuo Chengyun), covering 200+ topics from basic sorting to LCT and CDQ divide-and-conquer. Each lecture has a matching PowerPoint and Java implementation. This is course material, not a library — it's for developers preparing for competitive programming or technical interviews who can read Chinese.
The difficulty tiering is honest and useful: 入门 (intro), 必备 (essential), 扩展 (extended), 挺难 (quite hard) — you can jump to your level without guessing. The curriculum breadth is real: it doesn't stop at the usual LeetCode grind topics but goes all the way to persistent segment trees, virtual trees, and Mo's algorithm. The 'validator' (对数器) pattern taught early on — using a brute-force reference implementation to stress-test your optimized solution — is a genuinely practical technique that most algorithm courses skip. Actively maintained with commits in July 2026, not an abandoned dump.
Everything is in Chinese — slides, comments, variable names where they exist — which makes this a non-starter for anyone who doesn't read it. There's no build system: the Java files are raw source with no Maven or Gradle config, so you're compiling by hand or copying into an IDE project. The lecture content lives in binary PPTX files, which means no full-text search, no diffing, and no rendering without Office software. The code files have almost no comments explaining the non-obvious parts of each algorithm — you need the slides open alongside the code, and that coupling makes the repo harder to use standalone.