leetcode-master

Code随想录 (LeetCode-Master) is a structured study plan designed for learning data structures and algorithms. Problems are organized by knowledge domain and difficulty level, each accompanied by illustrated solutions and video explanations, making it suitable for systematic learning from beginner to advanced. The study roadmap covers the following modules: - Fundamentals (algorithm performance analysis, time/space complexity) - Arrays (binary search, element removal, spiral matrix, etc.) - Linked Lists (reversing linked lists, cycle detection, designing linked lists, etc.) - Hash Tables (two-sum, three-sum, four-sum, etc.) - Strings (string reversal, KMP algorithm, repeated substrings, etc.) - Two Pointers - Stacks and Queues (sliding window maximum, top K frequent elements, etc.) - Binary Trees (recursive/iterative traversal, level-order traversal, BST operations, lowest common ancestor, etc.) - Backtracking (combinations, partitioning, subsets, permutations, N-Queens, Sudoku, etc.) - Greedy Algorithms (cookie distribution, jump games, interval problems, etc.) - Dynamic Programming (knapsack problems, house robber, stock trading series, subsequence series, edit distance, etc.) - Monotonic Stack (daily temperatures, trapping rainwater, largest rectangle in histogram, etc.) - Graph Theory (DFS/BFS, Union-Find, minimum spanning tree, topological sort, Dijkstra, Bellman-Ford, Floyd, A* algorithm, etc.) Each topic includes a complete learning chain of "theory → practice problems → summary and review." Solutions are primarily explained in C++, with community-contributed implementations in Java, Python, Go, JavaScript, and other languages. Supporting resources include algorithm lecture PDFs, 170 episodes of public algorithm courses, algorithm templates, and a learning community.