Solving Leetcode : Longest common prefix

This is leetcode problem number 14, difficulty of "Easy".

Problem being :

Write a function to find the longest common prefix string amongst an array of strings.

If there is no common prefix, return ""

The leetcode provides us with the starting :

class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:

the longestCommonPrefix function will need list as an argument.

The way I thought of first, is using enumerate to loop through all the letters in the list.

prefix = strs[0]
for count, value in enumerate(strs[1:], 1):
    while value.find(prefix) != 0:
        prefix = prefix[:-1]
        if not prefix:
            return ""
return prefix

if not strs:
    return ""

1. Function initializes the prefix variable to the first string in the list, thus it being set to strs[0].
2. Iterates over the remaining strings in strs using enumerate with a starting index of 1 --> count takes on values 1, 2, 3, etc...
3. Enter a while loop that checks whether the prefix is a valid prefix of s
4. Use a .find() method of string, returning the index of the first occurence of the substring prefix in s.
5. If there is no prefix, return nothing.

The runtime ended up with 37ms, beating 56.29% of the other solutions summited, and 13.9 MB of memory taken, beating 79.57%.