improved common prefix

Author: Droid-An

Sprint-2/improve_with_precomputing/common_prefix/common_prefix.py

@@ -7,12 +7,14 @@ 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.
     """
+    strings_sorted = 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(1, len(strings_sorted)):
+        string = strings_sorted[i - 1]
+        other_string = strings_sorted[i]
+        common = find_common_prefix(string, other_string)
+        if len(common) > len(longest):
+            longest = common
     return longest