Longest common prefix
Given an array of strings, return their longest common prefix, or an empty string if there is none.
Implement
longest_common_prefix(strs: list[str]) → strExamples
in
[["flower","flow","flight"]]out"fl"What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 15 min
solution.py
InputExpectedGot
[["flower","flow","flight"]]"fl"not run yetsample