Company: Infosys
Difficulty: medium
Fastest Ferry Problem In the world of Pious , there are n islands, each of which is equipped with exactly one ferry. Each ferry has a unique speed . To travel from island A to island B , passengers must: First take a ferry from A to a central dock (station). Then another ferry from the dock to B . The following information is given to you: All islands are equidistant from the central dock. Each ferry is numbered from 1 to n according to their islands. Some pirates have robbed the data pertaining to the speeds of the ferries. However, we have the relative speed information. In other words, we know for each pair of ferries which one is faster as compared to the other one. This information is given to you in an array b , where each element in b contains two integers as follows: b[i][0] : The number of the ferry that is faster than b[i][1] th ferry. b[i][1] : The number of the ferry that is slower than b[i][0] th ferry. In total, there should be information about (n*(n-1))/2 pairs of compa