LeetCode 14, Easy. Topics: Array, String, Trie. View on LeetCode.
Generate this problem as a practice environment: tested reference solution, 16 parametrized pytest cases, and a playground notebook:
Problem
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 "".
Examples
Constraints
- 1 <= strs.length <= 200
- 0 <= strs[i].length <= 200
strs[i] consists of only lowercase English letters if it is non-empty.
Solution
Reference implementation from solution.py on GitHub, full suite in test_solution.py:
Complexity
Grind, NeetCode 250, NeetCode All. Last modified on September 7, 2026