easyArrayStringTrie 0 views

Longest Common Prefix

Write a function to find the longest common prefix string amongst an array of strings.

Write a function to find the longest common prefix string amongst an array of strings.

If there is no common prefix, return an empty string "".

Longest Common Prefix diagram

Example 1

Input: strs = ["flower","flow","flight"]

Output: "fl"

Example 2

Input: strs = ["dog","racecar","car"]

Output: ""

Explanation: There is no common prefix among the input strings.

Constraints

  • 1 <= strs.length <= 200
  • 0 <= strs[i].length <= 200
  • strs[i] consists of only lowercase English letters if it is non-empty.

Hints

No hints yet.

Companies

No companies reported yet.

Discussion

Sign in to join the discussion.

Loading discussion...

Test results

No test cases yet.