From de5065fedd488d7b2ec9fa2b50dabf08c1f55ee4 Mon Sep 17 00:00:00 2001
From: TuhtaevVadim <vadimtuhtaev@gmail.com@>
Date: Thu, 19 Dec 2024 10:49:34 +0400
Subject: [PATCH] =?UTF-8?q?=D0=94=D0=BE=D0=B1=D0=B0=D0=B2=D0=BB=D0=B5?=
 =?UTF-8?q?=D0=BD=20=D0=BF=D1=80=D0=BE=D0=B5=D0=BA=D1=82=20=D0=BB=D0=B0?=
 =?UTF-8?q?=D0=B1=D0=BE=D1=80=D0=B0=D1=82=D0=BE=D1=80=D0=BD=D0=BE=D0=B9=20?=
 =?UTF-8?q?=D1=80=D0=B0=D0=B1=D0=BE=D1=82=D1=8B?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 mainj.py | 25 +++++++++++++++++++++++++
 1 file changed, 25 insertions(+)
 create mode 100644 mainj.py

diff --git a/mainj.py b/mainj.py
new file mode 100644
index 0000000..cc08357
--- /dev/null
+++ b/mainj.py
@@ -0,0 +1,25 @@
+def longestCommonPrefix(strs) -> str:
+    s = min(strs, key=len)
+    prefix = []
+    for i in range(len(s)):
+        for j in range(i,len(s)):
+            prefix.append(s[i:j+1])
+    max_k = 0
+    f_p = ''
+    for i in prefix:
+        k = 0
+        for  j in strs:
+            if j!=s:
+                if i in j:
+                    k+=1
+                else: break
+        if k==len(strs)-1:
+            if max_k<len(i):
+                max_k=len(i)
+                f_p = i
+
+    if max_k>0:
+        return f_p
+    else:
+        return ""
+