Preview algorithms practice that tracks the missing idea.
This public Gradus demo course gives a limited preview of algorithms and data structures practice. The demo is local-only and requires no sign-in; full catalog access is available through the closed beta waitlist.
Preview topics
- Asymptotic analysis, recurrence reasoning, and loop invariants
- Arrays, lists, stacks, queues, trees, heaps, and hash tables
- Sorting, searching, divide-and-conquer, and dynamic programming
- Greedy choices, graph traversal, shortest paths, and spanning trees
- Correctness arguments, edge cases, and data-structure tradeoffs
Demo package
The course ID is algorithms_and_data_structures. The full generated package includes 12 chapters and 222 concepts; the public demo exposes an approved preview slice.