문제 https://school.programmers.co.kr/learn/courses/30/lessons/12927 정답 max heap import heapq def solution(n, works): works = [-work for work in works] heapq.heapify(works) for…

문제 https://school.programmers.co.kr/learn/courses/30/lessons/43162# 정답 def solution(n, computers): visited = [0 for _ in range(n)] networks = 0 for node in range(n): if…

문제 https://school.programmers.co.kr/learn/courses/30/lessons/12938 정답 아이디어가 없으면 풀 수 없는 문제 ㅜㅜ 결국 답을 보고 풀었다. def solution(n, s): quotion = s // n…

문제 https://school.programmers.co.kr/learn/courses/30/lessons/43105 정답 가장 좌측과 우측 값은 계속 더해지지만, 가운데 값은 경로상에서 더 큰값만 더하면 된다는 아이디어가 필요한 문제였다. def solution(…

문제 Loading...Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.LeetCode 정답…

문제 Loading...Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.LeetCode 정답…

문제 Loading...Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.LeetCode 정답…