From f3383da7a3539879cdb87b7313c95dc0e3de6101 Mon Sep 17 00:00:00 2001
From: SEONG JUN SHIN <shinsj4653@gmail.com>
Date: Sun, 22 Jun 2025 15:22:29 +0900
Subject: [PATCH 1/2] feat: add week 13 problems

---
 find-median-from-data-stream/shinsj4653.py       | 15 +++++++++++++++
 insert-interval/shinsj4653.py                    | 16 ++++++++++++++++
 kth-smallest-element-in-a-bst/shinsj4653.py      | 15 +++++++++++++++
 .../shinsj4653.py                                | 15 +++++++++++++++
 meeting-rooms/shinsj4653.py                      | 15 +++++++++++++++
 5 files changed, 76 insertions(+)
 create mode 100644 find-median-from-data-stream/shinsj4653.py
 create mode 100644 insert-interval/shinsj4653.py
 create mode 100644 kth-smallest-element-in-a-bst/shinsj4653.py
 create mode 100644 lowest-common-ancestor-of-a-binary-search-tree/shinsj4653.py
 create mode 100644 meeting-rooms/shinsj4653.py

diff --git a/find-median-from-data-stream/shinsj4653.py b/find-median-from-data-stream/shinsj4653.py
new file mode 100644
index 000000000..f2dd9f373
--- /dev/null
+++ b/find-median-from-data-stream/shinsj4653.py
@@ -0,0 +1,15 @@
+"""
+[문제풀이]
+# Inputs
+
+# Outputs
+
+# Constraints
+
+# Ideas
+
+[회고]
+
+"""
+
+
diff --git a/insert-interval/shinsj4653.py b/insert-interval/shinsj4653.py
new file mode 100644
index 000000000..53d2007dc
--- /dev/null
+++ b/insert-interval/shinsj4653.py
@@ -0,0 +1,16 @@
+"""
+[문제풀이]
+# Inputs
+
+# Outputs
+
+# Constraints
+
+# Ideas
+
+[회고]
+
+"""
+
+
+
diff --git a/kth-smallest-element-in-a-bst/shinsj4653.py b/kth-smallest-element-in-a-bst/shinsj4653.py
new file mode 100644
index 000000000..f2dd9f373
--- /dev/null
+++ b/kth-smallest-element-in-a-bst/shinsj4653.py
@@ -0,0 +1,15 @@
+"""
+[문제풀이]
+# Inputs
+
+# Outputs
+
+# Constraints
+
+# Ideas
+
+[회고]
+
+"""
+
+
diff --git a/lowest-common-ancestor-of-a-binary-search-tree/shinsj4653.py b/lowest-common-ancestor-of-a-binary-search-tree/shinsj4653.py
new file mode 100644
index 000000000..f2dd9f373
--- /dev/null
+++ b/lowest-common-ancestor-of-a-binary-search-tree/shinsj4653.py
@@ -0,0 +1,15 @@
+"""
+[문제풀이]
+# Inputs
+
+# Outputs
+
+# Constraints
+
+# Ideas
+
+[회고]
+
+"""
+
+
diff --git a/meeting-rooms/shinsj4653.py b/meeting-rooms/shinsj4653.py
new file mode 100644
index 000000000..f2dd9f373
--- /dev/null
+++ b/meeting-rooms/shinsj4653.py
@@ -0,0 +1,15 @@
+"""
+[문제풀이]
+# Inputs
+
+# Outputs
+
+# Constraints
+
+# Ideas
+
+[회고]
+
+"""
+
+

From 9fb4b286c50332526e99400a84e0449fb5322cda Mon Sep 17 00:00:00 2001
From: SEONG JUN SHIN <shinsj4653@gmail.com>
Date: Sun, 22 Jun 2025 15:43:58 +0900
Subject: [PATCH 2/2] feat: add meeting-rooms sol

---
 meeting-rooms/shinsj4653.py | 28 ++++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)

diff --git a/meeting-rooms/shinsj4653.py b/meeting-rooms/shinsj4653.py
index f2dd9f373..aa4cd68d3 100644
--- a/meeting-rooms/shinsj4653.py
+++ b/meeting-rooms/shinsj4653.py
@@ -1,15 +1,43 @@
 """
 [문제풀이]
 # Inputs
+[(0, 8), (8, 10)] -> 튜플 배열
 
 # Outputs
+모든 미팅 시간에 대해 참여할 수 있는지에 대한 여부
 
 # Constraints
+0 <= intervals 배열 <= 10^4
+구간 길이 : 2
+
 
 # Ideas
+정렬 후 각 요소 순회히면서, 첫번째 오른쪽 값보다 두번째 왼쪽 값이 크거나 같으면 통과
+아니면 false?
 
 [회고]
 
 """
 
 
+class Solution:
+    """
+    @param intervals: an array of meeting time intervals
+    @return: if a person could attend all meetings
+    """
+
+    def can_attend_meetings(self, intervals: List[Interval]) -> bool:
+        # Write your code here
+
+        intervals.sort(key=lambda x: (x[0]))
+        for i in range(len(intervals) - 1):
+            if intervals[i][1] > intervals[i + 1][0]:
+                return False
+
+        return True
+
+
+# 해설
+# 제출 코드와 동일!
+
+