Code Golf · #44 · 2026-05-18
Longest common prefix
Difficulty 3/3 · JavaScript
How to play
Write a JavaScript function body that passes all test cases using the fewest characters. Run against examples first, then submit for the full test suite. Eagle < Birdie < Par.
Given an array of strings, return their longest common prefix.
Examples
f(["flower","flow","flight"]) → fl
f(["abc","abc","abc"]) → abc
Loading your progress...
Your code (function body — receives input)
function(input) { 0 chars
}
Write the shortest JavaScript function body that passes all tests · Back to hub