Hash tables
Hash tables are high-performance array-based data structures that enable average O(1) search, insert and delete operations for key-value data. This guide explains hashing, collision resolution, performance, and common exam requirements.
📖Study Guide
In-depth bilingual notes with worked past paper examples.
✍️Practice Exam
Timed practice questions with mark scheme grading. Coming soon.
🎴Flashcards
Spaced repetition for key concepts and definitions. Coming soon.
📊Visualizer Coming Soon
Interactive plots and diagrams to build intuition. Coming soon.
Stuck on a specific question?
Snap a photo or paste your problem — Ollie (our AI tutor) walks through it step-by-step with diagrams.
Try Ollie free →
Snap a photo or paste your problem — Ollie (our AI tutor) walks through it step-by-step with diagrams.
Try Ollie free →