A reference list of the most common patterns in DS&A problems, including hashmaps, two pointers, DFS/BFS, dynamic programming, and more. Useful for interviews, practice, or competitive programming prep.
Explore multiple techniques for converting flat or semi-structured data into trees in Python, including recursive, map-based, and bottom-up builds like Merkle trees.
Understand what inversion counts are, how to compute them, and why they're crucial in sorting algorithms, permutation parity, and puzzle solvability.
A timed problem-solver's guide to efficient sorting in Python
A deceptively simple stack problem, and the mental traps it led me into before the greedy insight finally clicked
Heaps are binary trees, so why aren't they stored like one? Discover why arrays are the perfect data structure for implementing heaps — and how heaps work in the first place.