sort strs upfront

Author: katarzynakaz

Sprint-2/improve_with_precomputing/common_prefix/common_prefix.py

@@ -7,12 +7,20 @@ def find_longest_common_prefix(strings: List[str]):
 
     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 ""
     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
+    
+    sorted_strings = sorted(strings)
+    
+    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
 
 
@@ -22,3 +30,5 @@ def find_common_prefix(left: str, right: str) -> str:
         if left[i] != right[i]:
             return left[:i]
     return left[:min_length]
+
+