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.
Editorial is very bad. It doesn't explain clearly the essesntial concepts.
1. How to convert the graph to a complement graph efficiently? I was trying to put all the edges first in N2 approach. Like for node 1 put 2,3,4... , for node 2 put 1,3,4.... and so on. and then deleting the edges which was given as input. How not to do this is still not clear from the editorial.
2. What is the relationship between L1 and L2? Was djikstra or any other single source path algorithm was used?
It will be great if some more effort can be put on the editorials as they are the source of learning.
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 →
Editorial is very bad. It doesn't explain clearly the essesntial concepts.
1. How to convert the graph to a complement graph efficiently? I was trying to put all the edges first in N2 approach. Like for node 1 put 2,3,4... , for node 2 put 1,3,4.... and so on. and then deleting the edges which was given as input. How not to do this is still not clear from the editorial.
2. What is the relationship between L1 and L2? Was djikstra or any other single source path algorithm was used?
It will be great if some more effort can be put on the editorials as they are the source of learning.