Skip to content

Practice Path with Maximum Probability

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#1514
LeetCode Problem

Path with Maximum Probability

ArrayGraphHeap (Priority Queue)Shortest Path

Problem Statement

You are given an undirected weighted graph of n nodes (0-indexed), represented by an edge list where edges[i] = [a, b] is an undirected edge connecting the nodes a and b with a probability of success of traversing that edge succProb[i]. Given two nodes start and end, find the path with the maximum probability of success to go from start to end and return its success probability. If there is no path from start to end, return 0. Your answer will be accepted if it differs from the correct answer by at most 1e-5.

Source: Path with Maximum Probability on LeetCode. Use the original task for its coding environment and submissions.

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.25000

# Example 2

Input
n = 3, edges = [[0,1],[1,2],[0,2]], succProb = [0.5,0.5,0.3], start = 0, end = 2
Output
0.30000

# Example 3

Input
n = 3, edges = [[0,1]], succProb = [0.5], start = 0, end = 2
Output
0.00000

Constraints

2 <= n <= 10^4
0 <= start, end < n
start != end
0 <= a, b < n
a != b
0 <= succProb.length == edges.length <= 2*10^4
0 <= succProb[i] <= 1
There is at most one edge between every two nodes.

Related LeetCode Problems

Practice more problems similar to Path with Maximum Probability.

1 Two Sum Easy4 Median of Two Sorted Arrays Hard11 Container With Most Water Medium14 Longest Common Prefix Easy15 3Sum Medium
← Previous Number of Substrings With Only 1sNext → Best Position for a Service Centre

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free