Deloitte | COGNIZANT | IBM | CAPGEMINI
def ArrayChallenge(strArr):
s1, s2 = strArr[0], strArr[1]
n, m = len(s1), len(s2)
dp = [[0] * (m + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
for j in range(1, m + 1):
if s1[i - 1] == s2[j - 1]:
dp[i][j] = dp[i - 1][j - 1] + 1
else:
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1])
return dp[n][m]
AssestSense ✅
//q1
2 · 1.6K ·