Given an N arrays of size K each.. each of these K elements in the N arrays are sorted, each of these N*K elements are unique. Choose a single element from each of the N arrays, from the chosen subset of N elements. Subtract the minimum and maximum element. Now, this difference should be least possible minimum.. Hope the problem is clear :) :)
Sample: N=3, K=3 N=1 : 6, 16, 67 N=2 : 11,17,68 N=3 : 10, 15, 100 here if 16, 17, 15 are chosen.. we get the minimum difference as 17-15=2. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
