solulubeta
Sign in
NeetCode 150 / 2-D Dynamic Programming
14.09 · Problem

Edit Distance

Medium Two-string DP (Levenshtein) 1 video LC 72 Pro

This problem is part of solulu Pro

Return the minimum number of operations to turn word1 into word2, where an operation inserts, deletes or replaces one character.

Lifetime ₹1,999 ₹999 · Launch offer
Mark this problem as solved when you are finished.

Item 119 of 150 · updated 2026-10-12