SDE Sheet - Edit Distance

This video is part of the Dynamic Programming section under GFG SDE Sheet.

In this problem, we are given two strings s and t. Return the minimum number of operations required to convert s to t.
The possible operations are permitted:

• Insert a character at any position of the string.
  Remove any character from the string.
  Replace any character from the string with any other character.

Example :

Input: 
s = "geek", t = "gesek"
Output: 1
Explanation: One operation is required to insert 's' between two 'e's of s.

Try it out before watching the implementation of the problem in the video. We recommend watching the video, even if you can solve the problem. You may discover something new. All the best!!!

Do check out:-
Article: https://www.geeksforgeeks.org/edit-distance-dp-5/
Problem: https://www.geeksforgeeks.org/problems/edit-distance3702/1
SDE Sheet Link: https://www.geeksforgeeks.org/sde-sheet-a-complete-guide-for-sde-preparation/