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.
Isn't the problem of counting the number of topological sortings NP-hard (non-deterministic polynomial time). How did you come up with a solution that is
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Birthday Assignment
You are viewing a single comment's thread. Return to all comments →
Isn't the problem of counting the number of topological sortings NP-hard (non-deterministic polynomial time). How did you come up with a solution that is