// the find
algorithmzuo/weekly-problems
每周有营养的大厂算法面试题
A weekly collection of algorithm problems sourced from interviews at large Chinese tech companies (ByteDance, Alibaba, Tencent, etc.), solved in Java. Each weekly batch contains 3–8 problems with clean implementations. Aimed at developers preparing for competitive technical interviews in the Chinese job market.
The problem variety is genuinely good — you get graph algorithms (Tarjan SCC, A*, line sweep), DP variants, and combinatorics in the same week rather than grinding one topic for months. The file naming is descriptive enough that you can grep for a technique. Some problems are original or lightly modified company questions rather than straight LeetCode reposts, which means you're seeing closer-to-real interview material. The Java implementations are readable — no golf, no cryptic one-liners.
Dead since September 2023 with no indication it will resume, so you're getting ~2 years of coverage and nothing more recent. There are zero explanations — no comments, no README per problem, no complexity analysis — just code, which is fine if you already know what you're looking at but useless if you're trying to learn why an approach works. The repo is Chinese-language only in naming and any external video content, which cuts off non-Chinese-reading developers completely. No test harness at all; you can't run these without building your own scaffolding.