Sponsored Reserved space — layout preview until AdSense is connected
medium +18 pts

Longest common prefix

Column scan across all strings.

Implement `longest_common_prefix(words: list[str]) -> str`. Return `""` if there is none.

Constraints

1 ≤ len(words) ≤ 200. Each word has length ≤ 200.

Example

>>> longest_common_prefix(["flower","flow","flight"])
"fl"
18 points ~18 min

Recent Submissions

No submissions yet — hit Run Tests to try!

Hints

zip(*words) lets you scan columns until a mismatch.
Python 3
All tests passed!
Test Results
Press Ctrl+Enter or click Run Tests to execute your code.
Sponsored Reserved space — layout preview until AdSense is connected