Decision trees: how to think about backtracking, DP, and greedy algorithms (WIP)
tutorialDS&A
Understanding the relationship between these three popular algorithmic techniques.
Nil's Blog
Get Binary Search Right Every Time, Explained Without Code
tutorialDS&A
A binary search recipe that works for every problem, explained without code.
What Vibe Coding Actually Looks Like (prompts included)
The exact prompts used to create an interactive 3D torus visualization app with vibe coding.
Problem Solving BCtCI Style
DS&A
A problem walkthrough using the concepts from Beyond Cracking the Coding Interview.
Heapify Analysis Without Math
DS&A
A proof that heapify takes linear time without using complex equations.
Lazy vs Eager Algorithms
DS&A
Exploring the tradeoffs between lazy and eager implementations of common algorithms.
Actually Implementing Dijkstra's Algorithm
tutorialDS&A
A comprehensive guide to different implementations of Dijkstra's algorithm, with code.
Reachability Problems and DFS
tutorialDS&A
An extensive list of questions that can be solved with DFS.
Why Many Greedy Algorithms Are Pickier Than They Need To Be
researchDS&A
Many greedy algorithms can be modified to make local rather than global choices while still producing the same solutions.
Breaking Down Dynamic Programming
tutorialDS&A
A step-by-step guide to understanding and implementing dynamic programming algorithms with practical examples.
Iterative Tree Traversals: A Practical Guide
tutorialDS&A
A guide to implementing preorder, inorder, and postorder tree traversals iteratively.