Minimize Path Value

Problem Overview

• Find a path in a weighted undirected graph from source to destination that minimizes the stress level (the maximum edge weight along the path).
• Input includes N nodes, M edges, a source, and a destination; output the minimum stress value or -1 if no path exists.
• Applies to network routing, capacity limits, and risk minimization scenarios.
• A Palantir interviews coding interview problem and a common interview question.