class Solution : def longestCommonPrefix ( self , strs : List [ str ]) -> str : Longest_sum = "" for i in range ( len ( strs [ 0 ])): for j in strs : if i >= len ( j ) or j [ i ] ! = strs [ 0 ][ i ]: return Longest_sum Longest_sum += strs [ 0 ][ i ] return Longest_sum PROBLEM so in the ques we ha...
Source: [Dev.to](https://dev.to/piyushnextgen/code-and-approach-to-so-solve-longest-common-prefix-44jo)