A modern programming language that makes developers happier.

kotlinlang

I wonder if anyone know right term for googling the following thing… I have a set of paths like a/b/c, a/b/d, a/e, x/y/z, x/y/w and I need to find subpaths that are most frequent common subpaths. In the example above those would be a/b and x/y. I’m not yet sure how to define “most frequent” and how it all can be organized and calculated in a most efficient way (there could be thousands of them).

I think you want the "deepest common ancestor of every root folder". 