Skip to content
    SeaCode
    Learning tracksCode ArenaWorkshops & EventsInstructors
    Log inSign up
    Practice problems / Longest common prefix

    Longest common prefix

    Easystring

    Return the longest prefix shared by all the words, or an empty string if there is none.

    Example 1

    Input:  words = ["flower","flow","flight"]
    Output: "fl"

    Example 2

    Input:  words = ["dog","racecar","car"]
    Output: ""

    Constraints

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

    Submit checks your solution against 7 tests, including hidden ones.

    /**
     * @param {string[]} words
     * @return {string}
     */
    function longestCommonPrefix(words) {
      
    }
    
    Sign in to run
    SeaCode

    Learn to code for real, online or at our branch in front of Cairo University, Giza.

    Learn

    • All courses
    • Interactive tutorials
    • Interview practice problems
    • Mock interview
    • Learning tracks
    • Code Arena
    • Workshops & Events
    • Knowledge library
    • Team projects

    Your account

    • Log in
    • Sign up
    • Learning plan
    • Certificates
    • Site map

    Contact us

    • WhatsApp
    • 010 9094 1104
    • In front of Cairo University, Giza

    © 2026 SeaCode. All rights reserved.