Your question is Find Path Minimizing Maximum Edge Weight. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
Find a path that minimizes the maximum edge weight along the path using a variation of Dijkstra’s algorithm under dynamic constraints.
