From 8e2640ca1dd505fcadb97de365b1df8807f44c8e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=EA=B9=80=ED=9D=AC=EC=86=8C?= <h2s0_@naver.com>
Date: Mon, 5 Oct 2026 23:37:51 +0900
Subject: [PATCH] 14

---
 .../14. Longest Common Prefix.js"             | 20 +++++++++++++++++++
 1 file changed, 20 insertions(+)
 create mode 100644 "leetcode3/\352\271\200\355\235\254\354\206\214/14. Longest Common Prefix.js"

diff --git "a/leetcode3/\352\271\200\355\235\254\354\206\214/14. Longest Common Prefix.js" "b/leetcode3/\352\271\200\355\235\254\354\206\214/14. Longest Common Prefix.js"
new file mode 100644
index 00000000..9b19fc1c
--- /dev/null
+++ "b/leetcode3/\352\271\200\355\235\254\354\206\214/14. Longest Common Prefix.js"	
@@ -0,0 +1,20 @@
+/**
+ * @param {string[]} strs
+ * @return {string}
+ */
+
+ // 인덱스 0의 단어를 기준으로 잡고 그 다음 단어와 겹치는 글자들이 있으면 킾해놓고 다음꺼에 그게 있는지 비교하고...?
+
+var longestCommonPrefix = function(strs) {
+    const list = [];
+    for ( let i=1; i<strs.length; i++) {
+        let temp = "";
+        for (let j=0; j<strs[0].length; j++) {
+            if (strs[0][j] == strs[i][j]) {
+                temp += strs[0][j];
+            }
+        }
+        list.push(temp)
+    }
+    return list.reduce((a,b) => a.length <= b.length ? a : b)
+};
\ No newline at end of file