Leetcode 2203. Minimum Weighted Subgraph With the Required Paths

Given a weighted directed graph and nodes src1, src2, and dest, find the minimum total edge weight of a subgraph that allows both src1 and src2 to reach dest; the core challenge is combining shortest-path costs (from src1 and src2 and toward dest) to choose an optimal meeting/merge node that minimizes the total sum, or return -1 if no such routes exist.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2203. Minimum Weighted Subgraph With the Required Paths

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact