삽질 중에 최고의 삽질 개발자

def solution(n): return sum([ idx+1 for idx in range(n) if n % (idx+1) == 0 ])

def solution(n): return sum([ idx+1 for idx in range(n) if n % (idx+1) == 0 ])

def solution(n): return sum([ int(char) for char in str(n) ])

def solution(X, Y): x_arr = [ char for char in X ] y_arr = [ char for char in Y ] x_obj = { char: 0 for char in x_arr if char in y_arr } y_obj = { char: 0 for char in y_arr if char in x_arr } for number in x_arr: if number in x_obj.keys(): x_obj[number] += 1 for number in y_arr: if number in y_obj.keys(): y_obj[number] += 1 answer = [] if len(x_obj.keys()) == 0: return "-1" else: for number in x..

2주차 도둑맞은 집중력 Start!!!

def solution(babbling): check_babbling = ['aya', 'ye', 'woo', 'ma'] result = 0 for char in babbling: if len(char)

현재 87%정도 읽은 상태이다. 단 하나의 중요한 일에 집중하자. 단 하나의 집중하기 위해, 모든 딴짓들을 이겨내자!!!!!!

def solution(n, lost, reserve): reserve_arr = sorted([ data for data in reserve if data not in lost ]) lost_arr = sorted([ data for data in lost if data not in reserve ]) result = n if len(lost_arr) > 0 or len(reserve_arr) > 0: for data in reserve_arr: if data - 1 in lost_arr: lost_arr.remove(data-1) continue if data + 1 in lost_arr: lost_arr.remove(data+1) continue result = result - len(lost_ar..

def solution(participant, completion): participant_sort = sorted(participant) completion_sort = sorted(completion) result = "" for idx in range(len(participant_sort)): if idx < len(completion_sort): if participant_sort[idx] != completion_sort[idx]: result = participant_sort[idx] break else: pass else: result = participant_sort[len(participant_sort) - 1] pass return result def solution(participan..

def solution(s): same_count = 0 other_count = 0 check_char = "" result = 0 for char in s: if len(check_char) == 0: check_char = char same_count += 1 else: if check_char == char: same_count += 1 else: other_count += 1 if same_count == other_count: result += 1 check_char = "" else: pass result = result+1 if len(check_char) != 0 else result return result