Someone please help . I have done the edit distance question and getting wa on this solution. please tell how to correct this solution

general
1

int se(int i,int j,int count)
{
if(i==str.length() || j==str2.length())
return count;
if(str[i] == str2[j])
return se(i+1,j+1,count);
int a=se(i+1,j,count+1);
int b=se(i+1,j+1,count+1);
int c=se(i,j+1,count+1);
return min(a,min(b,c));
}

int32_t main()
{
w(x)
{
cin>>str>>str2;
cout<<se(0,0,0)<<endl;
}
}