[박종훈] 13주차 답안 제출

[dev-jonghoonpark]

Insert Interval

• 문제: https://leetcode.com/problems/insert-interval/
• 풀이: https://algorithm.jonghoonpark.com/2024/02/14/leetcode-57

Merge Intervals

• 문제: https://leetcode.com/problems/merge-intervals/
• 풀이: https://algorithm.jonghoonpark.com/2024/07/23/leetcode-56

Non Overlapping Intervals

• 문제: https://leetcode.com/problems/non-overlapping-intervals/
• 풀이: https://algorithm.jonghoonpark.com/2024/07/23/leetcode-435

Meeting Rooms II

• 문제:
  • 유료: https://leetcode.com/problems/meeting-rooms-ii/
  • 무료: https://www.lintcode.com/problem/919/
• 풀이: https://algorithm.jonghoonpark.com/2024/07/22/leetcode-253

Rotate Image

• 문제: https://leetcode.com/problems/rotate-image/
• 풀이: https://algorithm.jonghoonpark.com/2024/07/22/leetcode-48

[SamTheKorean]

일반적으로 복잡도 분석할 때 최악의 경우와 "일반적인"? 경우를 나누어서 분석하는게 좋을까요?

[dev-jonghoonpark]

미팅에서 나온 답변 :
일반적인 최악의 경우를 적을 것 (여기서는 n^3), 실제 인터뷰에서 불필요하게 케이스를 나누면 공격받을 수 있음.

[DaleSeo]