Skip to main content

Courses About Pricing Educators

Sign in Get started

Courses About Pricing Educators

Get started Sign in

Loading courses

Loading course

Data Structures and Algorithms: Uncharted

CoursesData Structures and Algorithms

Data Structures and Algorithms

You already write loops and functions. Now learn what makes software fast: hash maps, trees, heaps, graphs, dynamic programming, and the patterns that crack real problems. Every lesson solved in Python or JavaScript, your choice.

Intermediate to Hard
16 units
320 lessons

Follow the units in order, or explore any lesson that interests you.

Sign in to start

Course syllabus

16 units

1. Measuring Work
Measure operation growth directly, then use Big-O to name the shape.
20 lessonsStart here
Loading lessons…
2. Arrays and Strings
Use indexed storage, in-place movement, and string scans with honest costs.
20 lessons
3. HashingPro
Turn keys into fast lookups, handle collisions, and reuse map-and-set patterns.
20 lessons
4. Linked ListsPro
Build chains from nodes, then traverse and restructure them with pointers.
20 lessons
5. Stacks and QueuesPro
Control access order with LIFO stacks, FIFO queues, and double-ended variants.
20 lessons
6. Recursion and Divide and ConquerPro
Use base cases, smaller calls, and balanced halves to control recursive work.
20 lessons
7. SortingPro
Compare elementary sorts, divide-and-conquer sorts, stability, and data-aware alternatives.
20 lessons
8. Binary SearchPro
Narrow ordered intervals, find duplicate bounds, and search monotone answer spaces.
20 lessons
9. TreesPro
Model hierarchy, traverse every branch, and use ordered trees with honest balance costs.
20 lessons
10. Heaps and Priority QueuesPro
Keep the next priority at the root, restore the heap locally, and solve top-k work.
20 lessons
11. GraphsPro
Model networks, traverse them breadth-first and depth-first, and order dependencies.
20 lessons
12. Weighted Graphs and Union-FindPro
Route by total cost, reconstruct paths, compress connectivity, and span a network cheaply.
20 lessons
13. Dynamic ProgrammingPro
Name reusable subproblems, remember their results, and build tables for classic choices.
20 lessons
14. Greedy and BacktrackingPro
Know when a local choice is safe, then explore and prune when choices must be undone.
20 lessons
15. The Pattern PlaybookPro
Recognize pointer, window, prefix, interval, trie, and composite openings quickly.
20 lessons
16. The GauntletPro
Practice the full interview loop, communicate tradeoffs, and combine the course in one dispatch system.
20 lessons

320 lessons across 16 units. Start with any published unit.