longest common prefix algorithm

Author: BrianRuizy

solutions/Easy/14. Longest Common Prefix.py

@@ -0,0 +1,17 @@
+class Solution:
+    def longestCommonPrefix(self, strs: List[str]) -> str:
+        # traverse smallest word in list
+        # traverse all words in list
+        # if letter in word does not equal the current letter of smallest word
+        # return current word sliced up to the current index of smallest word
+        if not strs:
+            return ''
+
+        smallest = min(strs, key=len)
+        for index, char in enumerate(smallest):
+            for word in strs:
+                if word[index] != char:
+                    return smallest[:index]
+
+        # finally return smallest
+        return smallest