Dsa
Strings
Easy
Longest Common Prefix
Given a list of strings, write a function that determines the longest common prefix among the strings. If there is no common prefix, return an empty string.
Input format:
- A single line containing comma-separated strings.
Output format:
- A single line containing the longest common prefix.
Example:
Input:
apple,apricot,ape,application
Output:
ape
Key concepts
stringsprefixiteration
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now