Monday, May 19, 2014

Finding the longest common prefix from given strings

Given a list of strings, how do we find the longest common prefix of all the strings?

For example consider { "Anomaly", "Anatomy", "Analog", "Angry" } the longest common prefix is "An".

This is a simple algorithm. Assume the first string as the longest common prefix, and try to match with the other strings and modify the prefix accordingly.

Here is the C++ code which implements the above approach.