From 38762a2887c4e20da0ccd400fd0717ae03a555f1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=EA=B9=80=ED=9D=AC=EC=86=8C?= <h2s0_@naver.com>
Date: Tue, 6 Oct 2026 21:05:05 +0900
Subject: [PATCH 1/2] 125

---
 .../125. Valid Palindrome.js"                            | 9 +++++++++
 1 file changed, 9 insertions(+)
 create mode 100644 "leetcode3/\352\271\200\355\235\254\354\206\214/125. Valid Palindrome.js"

diff --git "a/leetcode3/\352\271\200\355\235\254\354\206\214/125. Valid Palindrome.js" "b/leetcode3/\352\271\200\355\235\254\354\206\214/125. Valid Palindrome.js"
new file mode 100644
index 00000000..d436770a
--- /dev/null
+++ "b/leetcode3/\352\271\200\355\235\254\354\206\214/125. Valid Palindrome.js"	
@@ -0,0 +1,9 @@
+/**
+ * @param {string} s
+ * @return {boolean}
+ */
+var isPalindrome = function(s) {
+    let str = s.replace(/[^a-z0-9]/gi, "").toLowerCase();
+    let reversed = str.split('').reverse().join('')
+    return str === reversed ? true : false
+};
\ No newline at end of file

From 7a7418d151b3f4e9785d08682839d6925104a573 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=EA=B9=80=ED=9D=AC=EC=86=8C?= <h2s0_@naver.com>
Date: Tue, 6 Oct 2026 22:41:05 +0900
Subject: [PATCH 2/2] 447

---
 .../447. Number of Boomerangs.js"             | 25 +++++++++++++++++++
 1 file changed, 25 insertions(+)
 create mode 100644 "leetcode3/\352\271\200\355\235\254\354\206\214/447. Number of Boomerangs.js"

diff --git "a/leetcode3/\352\271\200\355\235\254\354\206\214/447. Number of Boomerangs.js" "b/leetcode3/\352\271\200\355\235\254\354\206\214/447. Number of Boomerangs.js"
new file mode 100644
index 00000000..3b5b33f5
--- /dev/null
+++ "b/leetcode3/\352\271\200\355\235\254\354\206\214/447. Number of Boomerangs.js"	
@@ -0,0 +1,25 @@
+/**
+ * @param {number[][]} points
+ * @return {number}
+ */
+ // 한 점 i 를 기준으로 j와 k까지의 거리가 같으면 부메랑이고, (i, j, k)와 (i, k, j)는 서로 다른 것으로 센다.
+
+ // 기준점 하나 선택 - 나머지 모든 점과의 거리 계산 - 같은 거리인 점들이 있는지 확인
+
+var numberOfBoomerangs = function(points) {
+    if(points.length < 3) {
+        return 0;
+    }
+    for (let i =0; i<points.length; i++) {
+
+        for (let j=0; j<points.length; j++) {
+            if (i===j) continue;
+
+            let dx = points[i][0] - points[j][0];
+            let dy = points[i][1] - points[i][1];
+
+            let distance = dx * dx + dy * dy;
+
+        }
+    }
+};
\ No newline at end of file