Coders Crushby Napplied AI
Back to Arena
MediumGraphs

Path With Maximum Probability

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.

This is an Arena challenge - solutions are not shown publicly.

Work on this problem and submit your solution to contribute!

Stats
Views
0
Solutions
0
Submitted By

System

2/4/2026

Tags
graphsdijkstraprobability
Coders Crushby Napplied AI

The ultimate interview preparation platform. Master System Design, DSA, and tackle community challenges to crush your FAANG interviews.

Looking for jobs? Visit Napplied AI Jobs Search Agent

System Design

  • All Problems
  • Easy
  • Hard

DSA

  • All Problems
  • Dynamic Programming
  • Graphs

More

  • Problems Arena
  • Growth Paths
  • My Crush

Coders Crush by Napplied AI - Tech Interview & Coding Should Be Effortless