diff --git a/insert-interval/hu6r1s.py b/insert-interval/hu6r1s.py
new file mode 100644
index 000000000..21639d72e
--- /dev/null
+++ b/insert-interval/hu6r1s.py
@@ -0,0 +1,18 @@
+class Solution:
+    def insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:
+        intervals.append(newInterval)
+        intervals.sort()
+        output = [intervals[0]]
+        for x, y in intervals[1:]:
+            if output[-1][1] >= x:
+                output[-1][1] = max(y, output[-1][1])
+            else:
+                output.append([x, y])
+        return output
+
+
+"""
+newInterval을 집어넣은 다음 정렬을 해주면 인덱스 0에 있는 값 기준으로 정렬됨
+대소 비교를 해서 이전 배열의 인덱스 1이 현재 배열의 인덱스 0보다 크거나 같으면
+값을 변경해주고 아니라면 값을 그냥 추가한다.
+"""
diff --git a/kth-smallest-element-in-a-bst/hu6r1s.py b/kth-smallest-element-in-a-bst/hu6r1s.py
new file mode 100644
index 000000000..4f8a2265c
--- /dev/null
+++ b/kth-smallest-element-in-a-bst/hu6r1s.py
@@ -0,0 +1,25 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def kthSmallest(self, root: Optional[TreeNode], k: int) -> int:
+        values = []
+        def dfs(node):
+            if not node:
+                return
+            
+            dfs(node.left)
+            values.append(node.val)
+            dfs(node.right)
+
+        
+        dfs(root)
+        return values[k-1]
+    
+"""
+이진 탐색 트리는 왼쪽은 val보다 작고 오른쪽은 val보다 큼
+그렇기에 중위순회 방식으로 하면 자연스럽게 정렬된 상태로 배열에 들어가게 된다.
+"""
diff --git a/lowest-common-ancestor-of-a-binary-search-tree/hu6r1s.py b/lowest-common-ancestor-of-a-binary-search-tree/hu6r1s.py
new file mode 100644
index 000000000..9783861f1
--- /dev/null
+++ b/lowest-common-ancestor-of-a-binary-search-tree/hu6r1s.py
@@ -0,0 +1,14 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+class Solution:
+    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
+        if p.val < root.val and q.val < root.val:
+            return self.lowestCommonAncestor(root.left, p, q)
+        if root.val < p.val and root.val < q.val:
+            return self.lowestCommonAncestor(root.right, p, q)
+        return root
diff --git a/meeting-rooms/hu6r1s.py b/meeting-rooms/hu6r1s.py
new file mode 100644
index 000000000..b7b831135
--- /dev/null
+++ b/meeting-rooms/hu6r1s.py
@@ -0,0 +1,7 @@
+class Solution:
+    def canAttendMeetings(self, intervals: List[List[int]]) -> bool:
+        for i in range(len(intervals)):
+            for j in range(i + 1, len(intervals)):
+                if intervals[i][0] < intervals[j][1] and intervals[j][0] < intervals[i][1]:
+                    return False
+        return True
diff --git a/non-overlapping-intervals/hu6r1s.py b/non-overlapping-intervals/hu6r1s.py
new file mode 100644
index 000000000..72dc55553
--- /dev/null
+++ b/non-overlapping-intervals/hu6r1s.py
@@ -0,0 +1,13 @@
+class Solution:
+    def eraseOverlapIntervals(self, intervals: List[List[int]]) -> int:
+        intervals.sort()
+        cnt = 0
+        pre_end = intervals[0][1]
+        for i in range(1, len(intervals)):
+            start, end = intervals[i]
+            if pre_end > start:
+                cnt += 1
+                pre_end = min(end, pre_end)
+            else:
+                pre_end = end
+        return cnt
diff --git a/number-of-connected-components-in-an-undirected-graph/hu6r1s.py b/number-of-connected-components-in-an-undirected-graph/hu6r1s.py
new file mode 100644
index 000000000..e6eb51e3c
--- /dev/null
+++ b/number-of-connected-components-in-an-undirected-graph/hu6r1s.py
@@ -0,0 +1,43 @@
+class Solution:
+    # def countComponents(self, n: int, edges: List[List[int]]) -> int:
+    #     graph = [[] for _ in range(n)]
+    #     for node, adj in edges:
+    #         graph[node].append(adj)
+    #         graph[adj].append(node)
+
+    #     visited = set()
+
+    #     def dfs(node):
+    #         visited.add(node)
+    #         for adj in graph[node]:
+    #             if adj not in visited:
+    #                 dfs(adj)
+
+    #     cnt = 0
+    #     for node in range(n):
+    #         if node not in visited:
+    #             cnt += 1
+    #             dfs(node)
+    #     return cnt
+
+
+    def countComponents(self, n: int, edges: List[List[int]]) -> int:
+        graph = [[] for _ in range(n)]
+        for node, adj in edges:
+            graph[node].append(adj)
+            graph[adj].append(node)
+
+        cnt = 0
+        visited = set()
+        for node in range(n):
+            if node in visited:
+                continue
+            cnt += 1
+            queue = deque([node])
+            while queue:
+                node = queue.pop()
+                visited.add(node)
+                for adj in graph[node]:
+                    if adj not in visited:
+                        queue.append(adj)
+        return cnt
diff --git a/remove-nth-node-from-end-of-list/hu6r1s.py b/remove-nth-node-from-end-of-list/hu6r1s.py
new file mode 100644
index 000000000..06713bf8e
--- /dev/null
+++ b/remove-nth-node-from-end-of-list/hu6r1s.py
@@ -0,0 +1,20 @@
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution:
+    def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:
+        length = 0
+        node = head
+        while node:
+            length += 1
+            node = node.next
+
+        dummy = ListNode(None, head)
+        node = dummy
+        for _ in range(length - n):
+            node = node.next
+
+        node.next = node.next.next
+        return dummy.next
diff --git a/same-tree/hu6r1s.py b/same-tree/hu6r1s.py
new file mode 100644
index 000000000..60d411ea7
--- /dev/null
+++ b/same-tree/hu6r1s.py
@@ -0,0 +1,15 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def isSameTree(self, p: Optional[TreeNode], q: Optional[TreeNode]) -> bool:
+        if not p and not q:
+            return True
+        if not p or not q:
+            return False
+        if p.val != q.val:
+            return False
+        return self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)