Compute the edit distance between two strings.

Use dynamic programming where dp[i][j] is the minimum inserts, deletes, or substitutions for the first i and j characters. Each cell takes the best predecessor plus cost; roll rows for O(min(m,n)) space.

Test empty input, one-element input, duplicates, boundary indices, invalid states, and the largest allowed size; state time and space complexity.