Longest Common Prefix — Easy Coding Interview Question

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 "".

Example

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

Output: "fl"

Constraints

• 1 ≤ strs.length ≤ 200
• 0 ≤ strs[i].length ≤ 200

Topics & Companies

Topics: strings

Asked by: Amazon, Google, Meta, Microsoft, Apple

Optimal Solution Complexity

Time complexity: O(S). Space complexity: O(1).

Practice more

• All DSA Problems
• DSA Patterns