For this Question: Given two strings A and B, you can perform three types of moves:-
1. Insert an element at any position
2. Delete an element from any position
3. Replace any element.
Your task is to convert String A into String B in a minimum number of moves.First line of input contains the string A, next line contains the string B.

Constraints:-
1 <= |A|, |B| <= 1000

Note:- String will contain only lowercase English lettersPrint the minimum number of moves.Sample Input:-
geek
gseke

Sample Output:-
2

Explanation:-
replace s with e and delete the last element

Sample input:-
Newton
School

Sample Output:-
5, I have written this Solution Code: 
def minimumMoves(a,b):
	m = len(a)
	n= len(b)
	dp = [[0 for i in range(n + 1)] for i in range(m + 1)]

	for i in range(m+1):
		for j in range(n+1):
			if(i==0):
				dp[i][j] = j
			elif(j==0):
				dp[i][j] = i
			elif(a[i-1] == b[j-1]):
				dp[i][j] = dp[i-1][j-1]
			else:
				dp[i][j] = 1 + min(dp[i][j-1],dp[i-1][j],dp[i-1][j-1])
	return dp[m][n]
a = input()
b = input()
print(minimumMoves(a,b)), In this Programming Language: Python, Now tell me if this Code is compilable or not?