GoalScope — longest_increasing_subsequence (Qwen2.5-Coder-32B-Instruct) — hover a token to see the patched verbalization
↵
<code>↵
def longest_increasing_subsequence(nums):↵
"""Finds the length of the longest strictly increasing subsequence."""↵
if not nums:↵
return 0↵
↵
dp = [1] * len(nums)↵
for i in range(1, len(nums)):↵
for j in range(i):↵
if nums[i] > nums[j]:↵
dp[i] = max(dp[i], dp[j] + 1)↵
↵
return max(dp)↵
</code>