// the find
youngyangyang04/kamacoder-solutions
卡码网题解全集
A Chinese-language collection of written solutions to the problems on kamacoder.com, an ACM-mode practice site that also hosts real company test questions. It has roughly 250 markdown files numbered to match the platform's problem IDs, and the README is mostly an invitation to the author's study group. It is useful for Chinese-speaking developers preparing for ACM-style interviews and of little use to anyone else.
Several problems have more than one solution file, which shows the trade-offs instead of a single answer. 0047 has a heap Dijkstra and a naive Dijkstra, 0053 separates Kruskal from Prim, 0094 keeps an SPFA version next to the main one, and 0099 has both DFS and BFS island counts. The file names lead with the platform problem number, so a problem can be found directly from its kamacoder ID. Coverage runs through the standard graph, DP, tree, and linked-list material and reaches the 2025 contest sets (the 小红, 小美, and 游游 problems from 0121 onward), so it tracks recent test questions.
The last push was 2025-05-19, more than a year ago, while the README still describes the list as continuously updated. Treat the coverage as a snapshot. GitHub reports no language because the code sits inside markdown, and the visible tree has no build file, test harness, or runnable project, so nothing in the repo confirms the solutions compile or pass the judge. The numbering is not clean: 0047 and 0053 each have three files, 0121 has two, and 0139 has two with different titles (可爱串 and 完美数), so the mapping from ID to solution is ambiguous.