// the find
algorithmzuo/coding-for-great-offer
大厂算法和数据结构刷题班
A Java solutions repository for algorithm and data structure problems, primarily targeting candidates preparing for interviews at large Chinese tech companies (FAANG equivalents like ByteDance, Alibaba, Tencent). It covers ~52 class sessions worth of problems spanning classic LeetCode questions, competitive programming problems, and company-specific interview problems. The target audience is Chinese-speaking developers grinding interview prep.
The problem selection goes well beyond easy LeetCode — classes 1–26 include genuinely hard problems like tree chain partitioning (class21), Tarjan LCA (class23), and dynamic segment trees (class47), which you rarely see covered together. The progression from harder custom problems (classes 1–26) to LeetCode-numbered problems (classes 27–52) gives a clear sense of difficulty tiering. Coverage of niche but interview-relevant topics like LFU cache (class19), skyline problem (class04), and optimal account balancing (class47) is solid. The sheer volume — 52 classes, hundreds of problems — means most hard interview topics are hit at least once.
There are zero explanatory comments or README documentation explaining the approach or why a solution works — it's raw code with no context, which limits its value for learning versus just copying. The repo went dead in September 2023 and never recovered, so newer problem patterns and interview trends from the last two years are absent. The class naming scheme (class01 through class52) is opaque — there's no index or curriculum map, so finding a specific topic requires grepping. It's also entirely Chinese-language in orientation; the few explanation files (说明) are presumably in Chinese, making this nearly inaccessible to non-Chinese readers.