We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
For Solving this question here is my submission:
1- Find the adjacency list of compliment of the graph (this will be representing the village roads)
2- Run he BFS with shortest distance
This is the simplest method in which this problem can be solved
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Rust & Murderer
You are viewing a single comment's thread. Return to all comments →
For Solving this question here is my submission: 1- Find the adjacency list of compliment of the graph (this will be representing the village roads) 2- Run he BFS with shortest distance
This is the simplest method in which this problem can be solved