Create 1514-path-with-maximum-probability.py

Author: neetcode-gh

Diff for: python/1514-path-with-maximum-probability.py

@@ -0,0 +1,21 @@
+class Solution:
+    def maxProbability(self, n: int, edges: List[List[int]], succProb: List[float], start: int, end: int) -> float:
+        adj = collections.defaultdict(list)
+        for i in range(len(edges)):
+            src, dst = edges[i]
+            adj[src].append([dst, succProb[i]])
+            adj[dst].append([src, succProb[i]])
+
+        pq = [(-1, start)]
+        visit = set()
+
+        while pq:
+            prob, cur = heapq.heappop(pq)
+            visit.add(cur)
+
+            if cur == end:
+                return prob * -1
+            for nei, edgeProb in adj[cur]:
+                if nei not in visit:
+                    heapq.heappush(pq, (prob * edgeProb, nei))
+        return 0