Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 250

Path with Maximum Probability

MediumAdvanced Graphs

Undirected edges edges[i] succeed with succProb[i]. Return the maximum probability of a path from start to end, or 0 if none. Tests compare to 5 decimal places via JSON numbers.

Examples

Example 1

Input: n = 3, edges = [[0,1],[1,2],[0,2]], succProb = [0.5,0.5,0.2], start = 0, end = 2

Output: 0.25

Constraints

2 ≤ n ≤ 10⁴

Target ComplexityNot required

O(V + E) Time · O(V) Space

Companies (2)

GoogleAmazon

Node 22.08.0

Loading editor…

Test casesRun to compare output

Inputn = 3, edges = [[0,1],[1,2],[0,2]], succProb = [0.5,0.5,0.2], start = 0, end = 2

Expected0.25

Output—