LeetCode
Experience
#3600 Maximize Spanning Tree Stability with Upgrades
Interview Experience
LeetCode #3600: Maximize Spanning Tree Stability with Upgrades. Difficulty: Hard. Topics: Binary Search, Greedy, Union-Find, Graph Theory, Minimum Spanning Tree. Asked at Google in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →Topics
Graph Theory
Minimum Spanning Tree
Union-Find
Binary Search
Graph
Greedy
Union Find