从限时知识测试中选择，以衡量您的理解，或选择不限时的练习题，以便您按照自己的节奏学习。所有问题涵盖核心算法主题，包括排序、搜索、图算法、动态规划和数据结构。
知识测试
限时评估，评估您对算法概念、时间复杂度和问题解决方法的理解。结果包括按主题的得分细分。
| Level | Questions | Time | Description | |
|---|---|---|---|---|
| Beginner | 20 | 15 min | Basic concepts: Big O notation, simple sorting (bubble, insertion, selection), linear and binary search, basic recursion | Start |
| Intermediate | 25 | 20 min | Merge sort, quick sort, BFS/DFS, hash tables, stacks, queues, basic dynamic programming, greedy algorithms | Start |
| Advanced | 25 | 25 min | Dijkstra, Bellman-Ford, MST algorithms, advanced DP (knapsack, LCS), backtracking, amortized analysis | Start |
| Expert | 30 | 30 min | NP-completeness, network flow, randomized algorithms, approximation algorithms, string matching (KMP, Rabin-Karp), advanced graph theory | Start |
练习题
不限时的练习，旨在学习。按照自己的节奏解决问题，并为每个答案提供提示和详细解释。
| Level | Questions | Time | Description | |
|---|---|---|---|---|
| Beginner | 15 | Untimed | Step-by-step exercises on basic sorting, searching, and recursion with detailed explanations | Start |
| Intermediate | 20 | Untimed | Practice divide-and-conquer, basic graph traversal, and introductory dynamic programming problems | Start |
| Advanced | 20 | Untimed | Work through shortest path algorithms, MST construction, advanced DP table-filling, and backtracking problems | Start |
| Expert | 25 | Untimed | Challenge problems on NP-hard reductions, flow networks, string algorithms, and competitive programming techniques | Start |