Prepare for software engineering job interviews by studying 200+ solved LeetCode problems with explanations.
Learn algorithm patterns and data structures through a structured 91-day study plan.
Use Anki flashcards to memorize common coding patterns and problem-solving techniques.
Review JavaScript implementations of classic algorithms like dynamic programming, graph traversal, and binary search.
This repository is a personal collection of solutions to coding problems from LeetCode, a popular platform used by software engineers to practice algorithm and data structure challenges, especially when preparing for technical job interviews. The author, writing primarily in Chinese, documents their own problem-solving journey through over 200 classic LeetCode problems, along with deeper guides on specific algorithm topics. The repository is organized into five main parts: detailed breakdowns of individual problems (including thought processes and working code), summaries of common algorithms and data structures, a set of Anki flashcard files so you can memorize key patterns, a daily problem activity where a community works through one problem together each day, and a planning section for future additions. Algorithms covered include divide and conquer, binary search, greedy strategies, sorting methods, backtracking, graph traversal, and dynamic programming. Data structures covered include arrays, linked lists, stacks, queues, hash tables, heaps, trees, and tries. You would use this repository if you are studying for software engineering interviews and want detailed Chinese-language explanations of LeetCode problems, or if you want a structured 91-day study plan to work through algorithmic fundamentals systematically. There is also a companion browser extension and an associated published book. The primary language for code examples is JavaScript, though the conceptual discussions apply broadly to algorithm study regardless of language.
Generated 2026-05-18 · Model: sonnet-4-6 · Verify against the repo before relying on details.