From e13cd8bd4079748b224963a8f19f3e2323bc6f5b Mon Sep 17 00:00:00 2001
From: rimogsu <newnyup@gmail.com>
Date: Tue, 29 Sep 2026 22:39:01 +0900
Subject: [PATCH] 242, 413

---
 .../v3/242. Valid Anagram.py"                 | 12 +++++
 .../v3/413. Arithmetic Slices.py"             | 46 +++++++++++++++++++
 2 files changed, 58 insertions(+)
 create mode 100644 "leetcode3/\353\263\200\354\247\200\355\230\221/v3/242. Valid Anagram.py"
 create mode 100644 "leetcode3/\353\263\200\354\247\200\355\230\221/v3/413. Arithmetic Slices.py"

diff --git "a/leetcode3/\353\263\200\354\247\200\355\230\221/v3/242. Valid Anagram.py" "b/leetcode3/\353\263\200\354\247\200\355\230\221/v3/242. Valid Anagram.py"
new file mode 100644
index 00000000..b45894a7
--- /dev/null
+++ "b/leetcode3/\353\263\200\354\247\200\355\230\221/v3/242. Valid Anagram.py"	
@@ -0,0 +1,12 @@
+'''
+1. 아이디어:
+그냥 문제에 주어진대로 구현하면 됨.
+2. 시간복잡도:
+o(n+m)
+3. 알고리즘:
+'''
+
+from collections import Counter
+class Solution:
+    def isAnagram(self, s: str, t: str) -> bool:
+        return Counter(s) == Counter(t)
\ No newline at end of file
diff --git "a/leetcode3/\353\263\200\354\247\200\355\230\221/v3/413. Arithmetic Slices.py" "b/leetcode3/\353\263\200\354\247\200\355\230\221/v3/413. Arithmetic Slices.py"
new file mode 100644
index 00000000..4e840e8e
--- /dev/null
+++ "b/leetcode3/\353\263\200\354\247\200\355\230\221/v3/413. Arithmetic Slices.py"	
@@ -0,0 +1,46 @@
+'''
+1. 아이디어:
+미분한다 생각하고 기울기를 구함.
+만약 6개가 등차수열이면 해당 것은 4+3+2+1 = 10개가됨.
+2. 시간복잡도:
+o(n)
+3. 알고리즘:
+'''
+
+"""
+1 2 3 4 5 6
+1 * 4 + 2 * 3 + 3 * 2 + 4 *1
+"""
+class Solution:
+    def numberOfArithmeticSlices(self, nums: list[int]) -> int:
+        n = len(nums)
+
+        tmp = []
+        for i in range(n-1):
+            tmp.append(nums[i+1] - nums[i])
+
+        m = len(tmp)
+        last = -10001
+        streak = 0
+        cases = []
+        for i in range(m):
+            print(last)
+            if last == tmp[i]:
+                streak += 1
+            else:
+                if streak >= 1:
+                    cases.append(streak)
+                streak = 0
+            
+            last = tmp[i]
+
+        if streak >= 1:
+            cases.append(streak)
+        
+        print(cases)
+
+        ans = 0
+        for c in cases:
+            for i in range(1, c+1):
+                ans += i
+        return ans
\ No newline at end of file