처음 나의 풀이 (동작은 됨)from collections import dequedef solution(begin, target, words): visited = [False] * len(words) queue = deque() for word in words: # 후보 단어 삽입 diff = 0 for idx in range(len(word)): if begin[idx] != word[idx]: diff += 1 if diff == 1: queue.append((word, 1)) visited[words.index(word)] = True while queu..