Core Data Structures — free lessons (Data Structures and Algorithms)
- 2. Data Structures and Dynamic Arrays — MIT OpenCourseWare (50 min)
- 4. Hashing — MIT OpenCourseWare (53 min)
- 8. Randomization: Universal & Perfect Hashing — MIT OpenCourseWare (82 min)
- 21. Cryptography: Hash Functions — MIT OpenCourseWare (82 min)
- Lecture 8: Hashing with Chaining — MIT OpenCourseWare (51 min)
- Lecture 10: Open Addressing, Cryptographic Hashing — MIT OpenCourseWare (51 min)
- 8. Binary Heaps — MIT OpenCourseWare (51 min)
- 7. Randomization: Skip Lists — MIT OpenCourseWare (81 min)
- Problem Session 4 — MIT OpenCourseWare (90 min)
- 9. Augmentation: Range Trees — MIT OpenCourseWare (85 min)
- CS50 for Business - Lecture 2 - Designing Data Structures — CS50 (80 min)
- Algorithms, Data Structures- CS50 for Lawyers 2019 — CS50 (78 min)
- 7. Memory Hierarchy Models — MIT OpenCourseWare (83 min)
- 8. Cache-Oblivious Structures I — MIT OpenCourseWare (87 min)
- Lecture 8 | Programming Abstractions (Stanford) — Stanford (43 min)
- 9. Cache-Oblivious Structures II — MIT OpenCourseWare (85 min)
- Lecture 9 | Programming Abstractions (Stanford) — Stanford (48 min)
- Lecture 10 | Programming Abstractions (Stanford) — Stanford (47 min)
- Lecture 11 | Programming Abstractions (Stanford) — Stanford (48 min)