I recently can across an interesting problem: Given a set of n directories, find the most nested directory that is an ancestor of all of them. This is equivalent to finding the longest common prefix . For example, if I have the following
...
המשך לקרוא>