Any Framework functions helping to find the longest common starting substring of multiple strings?
<p>I have a list of strings (which represent paths and) which should all have a common beginning (root path). I need to get that common beginning. </p>

<p>That's just a couple of lines to throw together, but I have the nagging feeling that this must be thrown together a million times a year and that there might be an algorithm in the framework that can be used for that, but couldn't find something.<br>
Also, I suppose this has been asked on SO before, but I came up dry.  </p>

<p>Any hints? </p>
