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

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

↵ <code>↵ def longest_increasing_subsequence_bs(nums):↵ """Patience sorting with binary search."""↵ if not nums:↵ return 0↵ ↵ piles = []↵ ↵ for num in nums:↵ left, right = 0, len(piles) - 1↵ while left <= right:↵ mid = (left + right) // 2↵ if piles[mid] >= num:↵ right = mid - 1↵ else:↵ left = mid + 1↵ ↵ if left == len(piles):↵ piles.append(num)↵ else:↵ piles[left] = num↵ ↵ return len(piles)↵ </code>