Your question is Shortest Path Reachability. 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).
Given a graph where each edge has a distance, determine if a start node can reach a target node, and if so, return the shortest distance.