Given a list of strings return the substring representing the longest common prefix

Question

Phishi · Accepted Answer

Consider inserting the strings into a "trie" and keep track of the longest prefix.

Sigiloso · Answer

b/w 2 strings -> the brute force method (comapre one by one until they are not equal).

divide and conquer the original problem by finding longest common prefix of every 2 strings, then lcp of the found lcps, and so on....

Luc · Answer

Sort strings first. Then compare each char of n and n+1 keeping track of longest prefix.

Google

Pergunta de entrevista da empresa Google

Respostas da entrevista

Empresas seguidas

Buscas de vagas