From d9dd2d8bdfd6eccf1ce5c096f20ef1ddfdb102eb Mon Sep 17 00:00:00 2001
From: Dale Seo <dale.seo@gmail.com>
Date: Mon, 17 Nov 2025 14:56:40 -0500
Subject: [PATCH 1/4] ci: remove merge group trigger from integration workflow

---
 .github/workflows/integration.yaml | 2 --
 1 file changed, 2 deletions(-)

diff --git a/.github/workflows/integration.yaml b/.github/workflows/integration.yaml
index a7cff26145..440ed01a52 100644
--- a/.github/workflows/integration.yaml
+++ b/.github/workflows/integration.yaml
@@ -2,12 +2,10 @@ name: Integration 🔄
 
 on:
   pull_request:
-  merge_group:
 
 jobs:
   linelint:
     runs-on: ubuntu-latest
-    if: github.event_name == 'pull_request'
     steps:
       - uses: actions/checkout@v4
         with:

From 2e2ab004d39c1ef1d201f1fb20e50d57a60c800a Mon Sep 17 00:00:00 2001
From: yuuuuuuyu <yuitfhk@gmail.com>
Date: Wed, 19 Nov 2025 18:24:49 +0900
Subject: [PATCH 2/4] valid anagram

---
 valid-anagram/YuuuuuuYu.java | 33 +++++++++++++++++++++++++++++++++
 1 file changed, 33 insertions(+)
 create mode 100644 valid-anagram/YuuuuuuYu.java

diff --git a/valid-anagram/YuuuuuuYu.java b/valid-anagram/YuuuuuuYu.java
new file mode 100644
index 0000000000..d965e0c201
--- /dev/null
+++ b/valid-anagram/YuuuuuuYu.java
@@ -0,0 +1,33 @@
+/**
+ * Runtime: 2ms
+ * Time Complexity: O(n)
+ *
+ * Memory: 44.56MB
+ * Space Complexity: O(1)
+ *
+ * Approach: a~z 알파벳 개수 배열을 사용하여 짝을 이루는지 검사
+ * - 알파벳 개수가 똑같다면 +- 했을 때 0이 됨
+ */
+class Solution {
+    public boolean isAnagram(String s, String t) {
+        if (s.length() != t.length()) return false;
+
+        int[] checkedArr = new int[26];
+        for (char element: s.toCharArray()) {
+            int index = (int)element - 'a';
+            checkedArr[index]++;
+        }
+
+        for (char element: t.toCharArray()) {
+            int index = (int)element - 'a';
+            checkedArr[index]--;
+        }
+
+        for (int alphabet: checkedArr) {
+            if (alphabet != 0)
+                return false;
+        }
+
+        return true;
+    }
+}

From 9288f65f84ae4b56a224020f2037c0bd13779691 Mon Sep 17 00:00:00 2001
From: yuuuuuuyu <yuitfhk@gmail.com>
Date: Wed, 19 Nov 2025 20:28:39 +0900
Subject: [PATCH 3/4] climbing stairs

---
 climbing-stairs/YuuuuuuYu.java | 26 ++++++++++++++++++++++++++
 1 file changed, 26 insertions(+)
 create mode 100644 climbing-stairs/YuuuuuuYu.java

diff --git a/climbing-stairs/YuuuuuuYu.java b/climbing-stairs/YuuuuuuYu.java
new file mode 100644
index 0000000000..ec6c35cd81
--- /dev/null
+++ b/climbing-stairs/YuuuuuuYu.java
@@ -0,0 +1,26 @@
+/**
+ * Runtime: 0ms
+ * Time Complexity: O(n)
+ *
+ * Memory: 42.18MB
+ * Space Complexity: O(n)
+ *
+ * Approach: DP를 이용한 점화식 활용
+ * - n번째 계단에 도달하는 방법은 (n-1)번째 계단에서 한 칸 올라오는 방법과
+ *                          (n-2)번째 계단에서 두 칸 올라오는 방법의 합과 같음
+ */
+class Solution {
+    public int climbStairs(int n) {
+        if (n == 1) return 1;
+        else if (n == 2) return 2;
+
+        int[] dp = new int[n+1];
+        dp[1] = 1;
+        dp[2] = 2;
+        for (int i=3; i<dp.length; i++) {
+            dp[i] = dp[i-1] + dp[i-2];
+        }
+
+        return dp[n];
+    }
+}
\ No newline at end of file

From 9300c7ea92d412ed00f923732813eb2f11b19c57 Mon Sep 17 00:00:00 2001
From: yuuuuuuyu <yuitfhk@gmail.com>
Date: Wed, 19 Nov 2025 20:30:10 +0900
Subject: [PATCH 4/4] =?UTF-8?q?=EA=B0=9C=ED=96=89=20=EC=B6=94=EA=B0=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 climbing-stairs/YuuuuuuYu.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/climbing-stairs/YuuuuuuYu.java b/climbing-stairs/YuuuuuuYu.java
index ec6c35cd81..0185327867 100644
--- a/climbing-stairs/YuuuuuuYu.java
+++ b/climbing-stairs/YuuuuuuYu.java
@@ -23,4 +23,4 @@ public int climbStairs(int n) {
 
         return dp[n];
     }
-}
\ No newline at end of file
+}