Google Meet screen - Round-1 (45 mins):\n - Algorithm question\n\nConsider a matrix of m*n size, where each point denotes a mountain.\nYou will be given co-cordinates for villages in this town.\nConsider during rainy season if water falls from highest mountain to lowest mountain, search for the highest mountain with minimum steps required to reach all the villages for the supply of  water.\nFind the time complexity too for above problem.\n\nEx: \n7,1,2,4,5\n6,4,6,3,2\n5,2,2i,1,9\n6,6,4,2,3\n2,1i,3,4,6\n\n\nVillages: (2,2), (4,1) - VIllages are marked as i for simplicity.\n\nRestrictions - You can go from a High Mountain to Lower mountain only. Since water will flow from High to Low.\nVillage point should also be considered in the water flow.\n\nSample Ans - (3,1) (Multiple ans are possible, but find the mountain with minimum distance only)\n\nTried best to remember the question. There was some more complexity also given but that I would leave for next question if anyone finds soln. for above.

Google Meet screen - Round-1 (45 mins):\n - Algorithm question\n\nConsider a matrix of m*n size, where each point denotes a mountain.\nYou will be given co-cord