GoalScope — longest_common_subsequence (Qwen2.5-Coder-32B-Instruct)

GoalScope — longest_common_subsequence (Qwen2.5-Coder-32B-Instruct) — hover a token to see the patched verbalization

↵ <code>↵ def longest_common_subsequence(s1, s2):↵ """Finds the longest common subsequence between two strings."""↵ m, n = len(s1), len(s2)↵ dp = [[0] * (n + 1) for _ in range(m + 1)]↵ ↵ for i in range(1, m + 1):↵ for j in range(1, n + 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])↵ ↵ lcs = []↵ i, j = m, n↵ while i > 0 and j > 0:↵ if s1[i - 1] == s2[j - 1]:↵ lcs.append(s1[i - 1])↵ i -= 1↵ j -= 1↵ elif dp[i - 1][j] > dp[i][j - 1]:↵ i -= 1↵ else:↵ j -= 1↵ ↵ return ''.join(reversed(lcs))↵ </code>