Longest Common Prefix | Leetcode 14 | String | Facebook Amazon Google

preview_player
Показать описание



Popular Playlists:

Follow me on -

#TopInterview #Facebook #Amazon #String #Code #Leetcode #Algorithm #DataStructure #Java #Preparation #NG #nickode #CookCodeTravel #CCT
Рекомендации по теме
Комментарии
Автор

Thanks for very understandable and clean code.

SahilSingh-pcvd
Автор

IN PYTHON
s=["flow", "flew", "flower"]
k=s[0]
flag=0
a=""
for x in range(len(k)):
for j in s[1:]:
if k[x]!=j[x]:
flag=1
else:
a=""+k[x]
if flag==1:
break
else:
print(a, end="")

aadhi_dinesh