32. Longest Common Prefix
EasyString algorithms
Return the longest string that is a prefix of every string in words, or an empty string if there is none.
Example 1
Input: words = ["flower", "flow", "flight"] Output: "fl"
Constraints
1 ≤ words.length ≤ 2000 ≤ words[i].length ≤ 200