Edit Distance

Category: Dynamic Programming

Difficulty: advanced

Description: Minimum edits to transform strings

Time Complexity: O(mn)

Space Complexity: O(mn)

Related LeetCode Problems

• 72. Edit Distance (Hard)
• 583. Delete Operation for Two Strings (Medium)
• 712. Minimum ASCII Delete Sum for Two Strings (Hard)
• 115. Distinct Subsequences (Hard)
• 1143. Longest Common Subsequence (Medium)
• 72. Edit Distance (duplicate) (Hard)
• 392. Is Subsequence (Easy)
• 72. Edit Distance (third) (Hard)
• 150. Evaluate Reverse Polish Notation (Medium)
• 1499. Max Value of Equation (Medium)