MCPcopy Create free account
hub / github.com/BlakeBrown/HackerRank-Solutions / main

Function main

Algorithms/Implementation/Minimum Distances.cpp:28–49  ·  view source on GitHub ↗

Brute force approach passes all test cases, but as with most questions of this format we can do better using a hashtable to get O(n) instead of O(n^2)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected