Fidelity·Software Engineer·Technical Phone Screen
- Given a list of strings, find the longest substring that appears in all of them. For example, given ['disgraceful', 'grace', 'gracefully', 'graceful'], the answer is 'grace'.
“I went with the simpler approach: find the shortest string in the list, binary search on substring length, then check each candidate against the rest.”