GoalScope — maximum_product_subarray (Qwen2.5-Coder-32B-Instruct) — hover a token to see the patched verbalization
<code>↵ def maximum_product_subarray(nums):↵ """Finds the maximum product of a contiguous subarray within an array of integers."""↵ if not nums:↵ return 0↵ ↵ max_product = min_product = result = nums[0]↵ ↵ for num in nums[1:]:↵ if num < 0:↵ max_product, min_product = min_product, max_product↵ ↵ max_product = max(num, max_product * num)↵ min_product = min(num, min_product * num)↵ ↵ result = max(result, max_product)↵ ↵ return result</code>