Available question text
Find a spanning tree that maximizes the minimum edge strength (stability) when some edges are mandatory (must be included and cannot be upgraded) and up to k optional edges can be doubled once. This is a parametric search problem — binary-search the target stability and use greedy/DSU feasibility checks to see if required edges plus optional edges that already meet or can be upgraded to meet the target (within k upgrades) can connect all nodes; return -1 if impossible.
Related questions
Continue with questions that share topics or the same question type.
- Choose Edges to Maximize Score in a Tree
Coding
- Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
Coding
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
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 3600. Maximize Spanning Tree Stability with Upgrades
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source