Minimum-weight path from source to destination via at least one intermediate node
Filed under BuyHatke
The question
In a directed positive-weighted graph, find the minimum weight to reach the destination while it is compulsory to pass through at least one intermediate node, in least complexity.
No write-up yet. Related questions below have one.
Related BuyHatke questions
Collected from public candidate posts and coding forums. Updated Nov 2026.