DSA
Data structures and algorithms
- 01 Arrays & Strings Master the two most fundamental data structures — contiguous memory, indexing, and common manipulation patterns. beginner 12 min →
- 02 Hash Maps & Sets Turn O(n) lookups into O(1) with hash-based data structures — the most practically useful tool in your kit. beginner 14 min →
- 03 Linked Lists Understand pointer-based data structures — nodes, traversal, and why they matter for queues, LRU caches, and more. beginner 13 min →
- 04 Stacks & Queues LIFO and FIFO — two simple abstractions that power undo systems, BFS, task schedulers, and expression parsing. beginner 11 min →
- 05 Binary Trees & BSTs Recursive thinking, tree traversals, and binary search trees — the gateway to hierarchical data. intermediate 16 min →
- 06 Graphs Represent relationships between entities — social networks, maps, dependencies — with BFS, DFS, and adjacency lists. intermediate 18 min →
- 07 Sorting Algorithms Merge sort, quicksort, and when to use which — plus the patterns that emerge from sorted data. intermediate 15 min →
- 08 Dynamic Programming Break complex problems into overlapping subproblems — the technique behind shortest paths, text diffing, and optimization. advanced 20 min →