Available question text
Find the path from start to end in an undirected graph that maximizes the product of edge success probabilities (return 0 if unreachable). This is a max-product shortest-path problem on a weighted graph and can be solved by converting multiplicative weights to additive (e.g., negative logs) or directly using a Dijkstra-like propagation of maximum probabilities.
Related questions
Continue with questions that share topics or the same question type.
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Maximum Path Quality of a Graph
Coding · Array · Backtracking · Graph Theory
- Maximum Path Sum with Conditional Node Processing
Coding
- Maximum Sum Leaf to Root Path in Binary Tree
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1514. Path with Maximum Probability
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source