From 76bc3aaba074e8cf4d687b0dafd0a669c4cbc659 Mon Sep 17 00:00:00 2001
From: Jinyoung Jeong <80400463+jyoung2419@users.noreply.github.com>
Date: Tue, 29 Sep 2026 22:26:38 +0900
Subject: [PATCH 1/2] Create 242. Valid Anagram

---
 .../242. Valid Anagram"                              | 12 ++++++++++++
 1 file changed, 12 insertions(+)
 create mode 100644 "leetcode3/\354\240\225\354\247\204\354\230\201/242. Valid Anagram"

diff --git "a/leetcode3/\354\240\225\354\247\204\354\230\201/242. Valid Anagram" "b/leetcode3/\354\240\225\354\247\204\354\230\201/242. Valid Anagram"
new file mode 100644
index 00000000..cd27199d
--- /dev/null
+++ "b/leetcode3/\354\240\225\354\247\204\354\230\201/242. Valid Anagram"	
@@ -0,0 +1,12 @@
+/**
+ * @param {string} s
+ * @param {string} t
+ * @return {boolean}
+ */
+var isAnagram = function(s, t) {
+   const a = s.split("").sort().join("");
+   const b = t.split("").sort().join("");
+
+   if (a == b) return true;
+   else return false;
+};

From b5decfe92a5c502dd7a0fb793ed59e7c3cdd145d Mon Sep 17 00:00:00 2001
From: Jinyoung Jeong <80400463+jyoung2419@users.noreply.github.com>
Date: Tue, 29 Sep 2026 22:26:58 +0900
Subject: [PATCH 2/2] Add function to count arithmetic slices

---
 .../413. Arithmetic Slices"                   | 21 +++++++++++++++++++
 1 file changed, 21 insertions(+)
 create mode 100644 "leetcode3/\354\240\225\354\247\204\354\230\201/413. Arithmetic Slices"

diff --git "a/leetcode3/\354\240\225\354\247\204\354\230\201/413. Arithmetic Slices" "b/leetcode3/\354\240\225\354\247\204\354\230\201/413. Arithmetic Slices"
new file mode 100644
index 00000000..4dcbc837
--- /dev/null
+++ "b/leetcode3/\354\240\225\354\247\204\354\230\201/413. Arithmetic Slices"	
@@ -0,0 +1,21 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var numberOfArithmeticSlices = function(nums) {
+    let count = 0;
+    let ans = 0;
+
+    if (nums.length <= 2) return 0;
+
+    for (let i = 2; i<nums.length; i++){
+        if ((nums[i] - nums[i-1]) == (nums[i-1] - nums[i-2])){
+            count++;
+            ans += count;
+        } else {
+            count = 0;
+        }
+    }
+
+    return ans;
+};