NeetCode #631LC-1514MediumAdvanced Graphs
← Back to All Problems#631 · #1514 · Path with Maximum Probability(概率最大的路径)
📌 Problem Statement & Constraints
You are given an undirected weighted graph with
n nodes, edges and succProb (the success probability of each edge), plus start_node and end_node. Return the maximum probability of reaching end_node, or 0 if unreachable. Constraints: 2 <= n <= 10^4, 0 <= edges.length <= 2 * 10^4, probabilities are in [0, 1].🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!