Categories
Browse all topics organized by difficulty levels. Each topic covers the same concept from beginner to advanced.
18
Topics
54
Articles
3
Levels
Understanding Tree Construction
Learn tree construction from building blueprint analogies to recursive implementation and compiler AST optimization.
DS Data Structures
Understanding Linked Lists
Master linked lists from treasure hunt analogies to memory layout and CPU cache performance.
Understanding Hash Tables
Learn hash tables from library catalog analogies to collision resolution and load factors.
Understanding Stacks
Learn stacks from pancake stack analogies to memory layout and function call management.
Understanding Tree Traversals
Learn tree traversals from library exploration analogies to cache performance optimization.
Understanding Tree Properties
Learn tree balance, height, and symmetry from architectural analogies to hardware-level optimization.
Understanding Binary Search Trees
Learn BSTs from magical library analogies to AVL/Red-Black trees and cache optimization.
Understanding BST Properties
Learn BST properties from sorted library analogies to augmented order-statistic trees and AVL/Red-Black comparisons.
Understanding Arrays vs Strings
Learn arrays and strings from library analogies to hardware-level optimization and SIMD instructions.
Understanding Tree Recursion
Master tree recursion from family tree analogies to call stack mechanics and performance optimization.
Understanding Tree Algorithms
Master tree algorithms from family gathering analogies to LCA implementation and hardware-level optimization.
Understanding Tree Serialization
Learn tree serialization from shipping container analogies to binary formats, Protocol Buffers, and compiler AST optimization.
AP Algorithms & Patterns
Understanding Two Pointers
Learn two pointers technique from treasure hunt analogies to CPU cache performance optimization.
Understanding Sliding Window
Learn sliding window technique from train window analogies to cache performance optimization.
Understanding Merge Algorithms
Learn merge algorithms from card sorting analogies to memory-efficient implementations.
Understanding Binary Arithmetic
Learn binary arithmetic from light switch analogies to CPU ALU design and bitwise optimization.
Understanding Dynamic Programming
Master DP through staircase analogies, from Fibonacci patterns to hardware-level optimization.
Understanding Interval Problems
Learn interval merging from meeting room scheduler analogies to CPU cache performance optimization.
Understanding Binary Search
Learn binary search from number guessing game analogies to CPU cache performance and branch prediction optimization.
Understanding String Parsing
Learn string parsing from librarian puzzle analogies to SIMD optimization and memory bandwidth considerations.
Understanding Array Manipulation
Learn array manipulation from bookshelf analogies to CPU cache performance and SIMD optimization.
Understanding BFS
Learn BFS from ripple-in-a-pond analogies to queue internals, cache performance, and production-system applications.
Understanding BFS vs DFS
Learn BFS vs DFS from maze exploration analogies to CPU cache optimization and branch prediction.
CC Core Concepts
J Java
Coming Soon
Python
JavaScript
Rust
Go