Tag: 분할 가능 배낭
-
그리디 알고리즘 완벽 정리 – 활동 선택, 회의실 배정 등 코딩테스트 필수 유형 풀이
Greedy algorithms decoded: solve activity selection, meeting rooms, and coin change in O(n log n). Spot the 3 cases where greedy fails.
Greedy algorithms decoded: solve activity selection, meeting rooms, and coin change in O(n log n). Spot the 3 cases where greedy fails.