GoalScope — binary_search_leftmost (Qwen2.5-Coder-32B-Instruct) — hover a token to see the patched verbalization
↵
<code>↵
def binary_search_leftmost(arr, target):↵
"""Binary search for the leftmost occurrence of target in arr."""↵
left, right = 0, len(arr) - 1↵
result = -1↵
while left <= right:↵
mid = left + (right - left) // 2↵
if arr[mid] == target:↵
result = mid↵
right = mid - 1↵
elif arr[mid] < target:↵
left = mid + 1↵
else:↵
right = mid - 1↵
return result↵
</code>