← Data Structures and Algorithms
My progress
You are practising as a guest — this progress lives in this browser session only. Create an account to keep it.
| Chapter | Answered | Correct |
|---|---|---|
| 1.Recursion II: Helper Methods, Backtracking and Memoization | 0/30 | — |
| 2.Generics | 0/30 | — |
| 3.Lambdas, Comparators and Streams | 0/33 | — |
| 4.The Collections Framework: Lists, Stacks, Queues and Deques | 0/33 | — |
| 5.Sets and Maps | 0/31 | — |
| 6.Algorithm Analysis and Correctness | 0/31 | — |
| 7.Recurrence Relations and Divide-and-Conquer | 0/31 | — |
| 8.Greedy Algorithms and Dynamic Programming | 0/31 | — |
| 9.Sorting | 0/32 | — |
| 10.Implementing Lists, Stacks and Queues | 0/32 | — |
| 11.Heaps and Priority Queues | 0/31 | — |
| 12.Binary Search Trees | 0/31 | — |
| 13.AVL Trees | 0/31 | — |
| 14.Hashing | 0/31 | — |
| 15.Graphs and Traversals | 0/30 | — |
| 16.Weighted Graphs: Shortest Paths and Spanning Trees | 0/31 | — |
To review (0)
Questions whose latest attempt was wrong. Re-read the Key Concepts paragraph first, then try again — three days later works best.
Nothing to review yet.