improve code for finding common prefix

Author: sheetalkharab

Sprint-2/improve_with_precomputing/common_prefix/common_prefix.py

@@ -7,12 +7,18 @@ 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 ""
+    
+    # Precompute: Sort so similar strings are near each other
+    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(strings) - 1) :
+        common = find_common_prefix(strings[i], strings[i+1])
+        if len(common) > len(longest):
+            longest = common
     return longest