//
//  main.cpp
//  Edit Distance
//
//  Created by Himanshu on 16/09/21.
//

#include <iostream>
#include <string>
using namespace std;

int solve (string s1, string s2) {
    int n = (int) s1.length(), m = (int) s2.length();
    int dp[n+1][m+1];
    
    for (int i=0; i<=n; i++) {
        for (int j=0; j<=m; j++) {
            dp[i][j] = 0;
        }
    }
    
    for (int i=0; i<=n; i++) {
        dp[i][0] = i;
    }
    
    for (int j=0; j<=m; j++) {
        dp[0][j] = j;
    }
    
    for (int i=1; i<=n; i++) {
        for (int j=1; j<=m; j++) {
            if (s1[i-1] == s2[j-1]) {
                dp[i][j] = dp[i-1][j-1];
            }
            else {
                dp[i][j] = 1 + min((min(dp[i-1][j], 
                                      dp[i][j-1])), 
                                      dp[i-1][j-1]);
            }
            
        }
    }
    
    return dp[n][m];
}

int main() {
    string s1 = "hello", s2 = "tell";
    cout<<solve(s1, s2)<<endl;
}