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....

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