1. 가장 가까운 같은 글자 작성 코드 1 2 3 4 5 6 7 8 9 10 11 12 def solution(s): char_set = {} answer = [-1]*len(s) for i, char in enumerate(s): if char in char_set: answer[i] = i - char_set[char] char_set[char] = i return answer Colored by Color Scripter cs 2. 폰켓몬 작성 코드 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 def solution(nums): answer = 0 b=[] for i in range(len(nums)): if nums[i] not in b: b.append(nums[i]) c =..