Problem Statement
Minimum operations to convert word1 to word2.
Approach
dp[i][j] = min(insert, delete, replace). Three choices at each step.
Time & Space Complexity
Time O(m×n), Space O(n).
This experience deserves a bigger screen
The DSA Visualizer is designed for deep focus,
side-by-side code, and real-time execution insight.
On small screens, that level of clarity can't be preserved.
Open on a tablet (landscape) or desktop for the intended experience.
Desktop experience preview