algorithms.tutorialhorizon.com

Shortest Range in K-sorted Lists | Algorithms

You have given k sorted lists, find the minimum range such that there is at least one element from each array within the interval. This is very nice and tricky solution, This problem was asked in the Google interview for software engineer position.