# Edit Distance

hard

1. You are given two strings s1 and s2. 2. You have to find the minimum number of operations needed to convert s1 to s2. Operations allowed are - Insert - You can insert any character in s1. Remove - You can remove any character in s1. Replace - You can replace any character in s1 with any other character.

## Constraints

1 <= length of s1,s2 <= 100

## Format

### Input

Two strings s1 and s2

### Output

Check the sample output and question video.

## Example

Sample Input

pepperatcoding
pepcoding

### Sample Output

5