##
Find smallest range containing elements from k lists
June 4, 2016

Given k sorted lists of integers of size n each, find the smallest range that includes at least element from each of the k lists. If more than one smallest ranges are found, print any one of them. Example : Input: K = 3 arr1[] : [4, 7, 9, 12, 15] arr2[] : [0, 8,… Read More »