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.
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