common prefix

Author: ZabihollahNamazi

Sprint-2/improve_with_precomputing/common_prefix/common_prefix.py

@@ -2,17 +2,15 @@
 
 
 def find_longest_common_prefix(strings: List[str]):
-    """
-    find_longest_common_prefix returns the longest string common at the start of any two strings in the passed list.
-
-    In the event that an empty list, a list containing one string, or a list of strings with no common prefixes is passed, the empty string will be returned.
-    """
+    if len(strings) < 2:
+        return ""
+    sorted_strings = sorted(strings)
     longest = ""
-    for string_index, string in enumerate(strings):
-        for other_string in strings[string_index+1:]:
-            common = find_common_prefix(string, other_string)
-            if len(common) > len(longest):
-                longest = common
+    for i in range(len(sorted_strings) - 1):
+        common = find_common_prefix(sorted_strings[i], sorted_strings[i + 1])
+        if len(common) > len(longest):
+            longest = common
+            
     return longest