Problem Set Index
As mentioned in Reading Methods on This Site, readers who wish to quickly prepare can focus on the chapters labeled as "Exercise."
However, these exercise chapters are scattered across different sections of the site directory, and some readers have expressed concerns about missing them. Therefore, I have compiled and organized all 33 "Exercise" chapter entries here in order, for the convenience of readers who need them.
Note
The directory provided on this page is only to serve as a quick index for readers who need to prepare quickly.
If you have sufficient time or energy, it is recommended to study according to the site's directory order for the best results.
Reminder
Each exercise chapter begins with a "Prerequisite Reading" section, indicating the algorithm frameworks and techniques required for the exercises. It is essential to study these contents before practicing.
Additionally, the site's content is continuously updated and optimized, and the order of chapters may be adjusted or new chapters added.
Exercise: Classic Problems of Linked List with Two Pointers
Exercise: Classic Problems of Array with Two Pointers
Exercise: Classic Problems of Prefix Sum Technique
Exercise: Classic Problems of Sliding Window Algorithm
Exercise: Classic Problems of Binary Search Algorithm
【Exercise】Solving Problems with "Traversal" Thinking I
【Exercise】Solving Problems with "Traversal" Thinking II
【Exercise】Solving Problems with "Traversal" Thinking III
【Exercise】Solving Problems with "Problem Decomposition" Thinking I
【Exercise】Solving Problems with "Problem Decomposition" Thinking II
【Exercise】Solving Problems Using Two Types of Thinking
【Exercise】Solving Problems Using Postorder Position I
【Exercise】Solving Problems Using Postorder Position II
【Exercise】Solving Problems Using Postorder Position III
【Exercise】Solving Problems Using Level Order Traversal I
【Exercise】Solving Problems Using Level Order Traversal II
【Exercise】Classic Binary Search Tree Problems I
【Exercise】Classic Binary Search Tree Problems II
【Exercise】Classic Stack Problems
【Exercise】Compilation of Parentheses Problems
【Exercise】Classic Queue Problems
【Exercise】Variants and Classic Problems of Monotonic Stack
【Exercise】General Implementation and Classic Problems of Monotonic Queue
【Exercise】More Hash Table Problems
【Exercise】Classic Priority Queue Problems
【Exercise】Trie Algorithm Exercises
【Exercise】Union-Find Classic Exercises
【Exercise】More Classic Design Exercises
【Exercise】Backtracking Classic Exercises I
【Exercise】Backtracking Classic Exercises II
【Exercise】Backtracking Classic Exercises III
【Exercise】BFS Classic Exercises I
【Exercise】BFS Classic Exercises II
【Exercise】Math Techniques Related Exercises
For dynamic programming related problems, please refer to the articles in the dynamic programming section, not listed here.