This is an unofficial, Java-based companion to the original book. Not affiliated with the author or publisher.
- 01: Why Data Structures Matter
- 02: Why Algorithms Matter
- 03: Oh Yes! Big O Notation
- 04: Speeding Up Your Code with Big O
- 05: Optimizing Code with and Without Big O
- 06: Optimizing for Optimistic Scenarios
- 07: Big O in Everyday Code
- 08: Blazing Fast Lookup with Hash Tables
- 09: Crafting Elegant Code with Stacks and Queues
- 10: Recursively Recurse with Recursion
- 11: Learning to Write in Recursive
- 12: Dynamic Programming
- 13: Recursive Algorithms for Speed
- 14: Node-Based Data Structures
- 15: Speeding Up All the Things with Binary Search Trees
- 16: Keeping Your Priorities Straight with Heaps
- 17: It Doesn’t Hurt to Trie
- 18: Connecting Everything with Graphs
- 19: Dealing with Space Constraints
- 20: Techniques for Code Optimization
Important
This repository is provided for educational purposes only.
All rights to the original book content belong to Jay Wengrow and The Pragmatic Bookshelf.