class Solution:
def longestCommonPrefix(self, strs: list[str]) -> str:
result =""
for i in range(len(strs[0])):
for s in strs:
if i==len(s) or s[i] != strs[0][i]:
return result
result +=strs[0][i]
return result
# your code goes here
Y2xhc3MgU29sdXRpb246CiAgICBkZWYgbG9uZ2VzdENvbW1vblByZWZpeChzZWxmLCBzdHJzOiBsaXN0W3N0cl0pIC0+IHN0cjoKICAgICAgICByZXN1bHQgPSIiCiAgICAgICAgZm9yIGkgaW4gcmFuZ2UobGVuKHN0cnNbMF0pKToKICAgICAgICAgICAgZm9yIHMgaW4gc3RyczoKICAgICAgICAgICAgICAgIGlmIGk9PWxlbihzKSBvciBzW2ldICE9IHN0cnNbMF1baV06CgogICAgICAgICAgICAgICAgICAgIHJldHVybiByZXN1bHQKICAgICAgICAgICAgcmVzdWx0ICs9c3Ryc1swXVtpXQogICAgICAgIHJldHVybiByZXN1bHQKICAgICAgICAKICAgICAgICAjIHlvdXIgY29kZSBnb2VzIGhlcmU=