I'm wondering how to approach this question. 
Let e1, . . ., en be n horizontal segments in the plane. Find, in linear time, a line that intersects all the segments and has the largest possible slope, or determine that there is no such line. Appreciate the help.