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

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

↵ <code>↵ def word_ladder(begin_word, end_word, word_list):↵ """Function to find the shortest transformation sequence from begin_word to end_word."""↵ from collections import deque, defaultdict↵ ↵ if end_word not in word_list:↵ return 0↵ ↵ L = len(begin_word)↵ patterns = defaultdict(list)↵ for word in word_list:↵ for i in range(L):↵ patterns[word[:i] + "*" + word[i+1:]].append(word)↵ ↵ queue = deque([(begin_word, 1)])↵ visited = set([begin_word])↵ ↵ while queue:↵ current_word, level = queue.popleft()↵ for i in range(L):↵ intermediate_word = current_word[:i] + "*" + current_word[i+1:]↵ for word in patterns[intermediate_word]:↵ if word == end_word:↵ return level + 1↵ if word not in visited:↵ visited.add(word)↵ queue.append((word, level + 1))↵ patterns[intermediate_word] = []↵ ↵ return 0↵ </code>