In a directed weighted graph where nodes have happiness scores, find a cycle with the minimum total edge weight that maximizes the sum of node happiness scores within the cycle.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.