LONGEST COMMON PREFIX | LEETCODE # 14 | PYTHON SOLUTION

LINK: leetcode.com/p...
Simple string based problem that is used as a common warm-up problem. Relatively straightforward logic, just need to vertically compare the characters until we get a mismatch or a given string ends.

[@svsk634b]

Correct my logic please, if I am wrong. For each character iterating through strs over and over again, wouldn't that be O(S^2)? Given the constrains 1

[@suri4Musiq]

Are you preparing for interviews?

[@crackfaang]

No just making videos of popular questions and trying to force myself to make at least 1 video a day to grow the channel