From 3a14e54ecc031a454f556f4d122d1764b886517c Mon Sep 17 00:00:00 2001
From: Won Joon Thomas Choi <113500771+724thomas@users.noreply.github.com>
Date: Wed, 7 Oct 2026 23:57:15 +0900
Subject: [PATCH 1/2] Create 88. Merge Sorted Array.py

---
 .../88. Merge Sorted Array.py"                | 21 +++++++++++++++++++
 1 file changed, 21 insertions(+)
 create mode 100644 "leetcode3/\354\265\234\354\233\220\354\244\200/88. Merge Sorted Array.py"

diff --git "a/leetcode3/\354\265\234\354\233\220\354\244\200/88. Merge Sorted Array.py" "b/leetcode3/\354\265\234\354\233\220\354\244\200/88. Merge Sorted Array.py"
new file mode 100644
index 00000000..e4d46e54
--- /dev/null
+++ "b/leetcode3/\354\265\234\354\233\220\354\244\200/88. Merge Sorted Array.py"	
@@ -0,0 +1,21 @@
+class Solution:
+    def merge(self, nums1: list[int], n: int, nums2: list[int], m: int) -> None:
+        """
+        Do not return anything, modify nums1 in-place instead.
+        """
+        n1, n2 = len(nums1), len(nums2)
+        index1, index2 = n-1, m-1
+        insert_index = len(nums1)-1
+
+        while insert_index >= 0:
+            num1 = nums1[index1] if index1>=0 else -float('inf')
+            num2 = nums2[index2] if index2>=0 else -float('inf')
+
+            if num1 > num2:
+                nums1[insert_index] = num1
+                index1-=1
+            else:
+                nums1[insert_index] = num2
+                index2-=1
+
+            insert_index-=1

From 3d89d4c071ce98fcecbac84a15466cde7e66c615 Mon Sep 17 00:00:00 2001
From: Won Joon Thomas Choi <113500771+724thomas@users.noreply.github.com>
Date: Thu, 8 Oct 2026 22:41:27 +0900
Subject: [PATCH 2/2] Create 26. Remove Duplicates from Sorted Array.py

---
 ...26. Remove Duplicates from Sorted Array.py" | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)
 create mode 100644 "leetcode3/\354\265\234\354\233\220\354\244\200/26. Remove Duplicates from Sorted Array.py"

diff --git "a/leetcode3/\354\265\234\354\233\220\354\244\200/26. Remove Duplicates from Sorted Array.py" "b/leetcode3/\354\265\234\354\233\220\354\244\200/26. Remove Duplicates from Sorted Array.py"
new file mode 100644
index 00000000..900249bb
--- /dev/null
+++ "b/leetcode3/\354\265\234\354\233\220\354\244\200/26. Remove Duplicates from Sorted Array.py"	
@@ -0,0 +1,18 @@
+class Solution:
+    def removeDuplicates(self, nums: list[int]) -> int:
+        index = 0
+        visited = set()
+        n = len(nums)
+        count = 0
+        for i in range(n):
+            num = nums[i]
+            if num in visited:
+                continue
+            
+            visited.add(num)
+            nums[index] = num
+            index+=1
+            count+=1
+        
+        return count
+