1 article
Grid DP is the pattern behind unique paths, minimum cost routes, edit distance, and longest common subsequence. Once you see the dependency arrows, every 2D DP problem becomes the same fill-order exercise.