This document discusses edit distance and its dynamic programming algorithm. Edit distance is a way to quantify how dissimilar two strings are by counting the minimum number of operations (insertions, deletions, substitutions) needed to transform one string into the other. The document presents the dynamic programming formulation and algorithm to solve edit distance in quadratic time and linear space.