def solution(N, stages): fail = {} success = len(stages) for i in range(1, N+1) : if i not in stages : fail[i] = 0 continue else : stop = stages.count(i) fail[i] = stop/success success -= stop return sorted(fail, key=lambda x : fail[x], reverse=True) 풀이 1) stages에 없는 단계(실패율 0) 저장 fail = {} success = len(stages) for i in range(1, N+1) : if i not in stages : fail[i] = 0 continue ① i 단계가 실패율이 '얼마' ..