Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3419. Minimize the Maximum Edge Weight of Graph
Given a directed weighted graph, remove edges so every node has at most threshold outgoing edges and node 0 is reachable from all nodes, minimizing the largest remaining edge weight; return that minimum maximum weight or -1 if impossible. The core challenge is selecting edges under per-node out-degree caps to preserve reachability to node 0 (usually tackled by feasibility checks over candidate weight limits).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.