← Oracle questions

Min and Max Cost to Reverse Directed Edges for Full Traversal

Filed under Oracle

Given N stops and M directed edges with specific costs to reverse each edge, determine the minimum and maximum cost to modify edge directions so that a path exists to visit all stops starting from…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Oracle questions

Collected from public candidate posts and coding forums. Updated Nov 2026.