We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent d327f10 commit d4151bdCopy full SHA for d4151bd
dynamic_programming/longest_common_subsequence.py
@@ -50,7 +50,7 @@ def longest_common_subsequence(x: str, y: str):
50
51
seq = ""
52
i, j = m, n
53
- while i > 0 and i > 0:
+ while i > 0 and j > 0:
54
if x[i - 1] == y[j - 1]:
55
match = 1
56
else:
0 commit comments