Given two strings str1 and str2 and below operations that can performed on str1. Find minimum number of edits (operations) required to convert ‘str1′ into ‘str2′.
All of the above operations are of cost=1.
Both the strings are of lowercase.
The First line of the input contains an integer T denoting the number of test cases. Then T test cases follow. Each tese case consists of two lines. The first line of each test case consists of two space separated integers P and Q denoting the length of the strings str1 and str2 respectively. The second line of each test case coantains two space separated strings str1 and str2 in order.
Corresponding to each test case, pirnt in a new line, the minimum number of operations required.
1 <= T <= 50
1 <= P <= 100
1 <= Q <= 100
Testcase 1: One operation is required to make 2 strings same i.e. removing 's' from str2.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.