In the process of becoming or practicing as a web application developer, it's easy to lose sight of Computer Science.
This collection of exercises and experiments seeks to help you build an understanding of those foundations.
- binary trees
- pathfinding algorithms
- luhn algorithm (checksumming)
- tries
- graphs
- linked lists
- bloom filters
- Skip Lists
- Hash Maps
- Red/Black Trees
- Persistent Data Structures
- Tries (more detail)
- Hashing algorithm implementation (maybe start with MurmurHash?)