# Minimum Weighted Subgraph With The Required Paths: Study Guide
Minimum Weighted Subgraph With The Required Paths shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Run Dijkstra from src1, from src2, and from dest on the reversed graph. Answer is min over meeting node v of d1[v] + d2[v] + d3[v].
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(E log V).
## Common mistake
Running Dijkstra from dest on the original graph instead of the reversed one.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at interview copilot app.