Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2285. Maximum Total Importance of Roads
Given an undirected graph, assign unique labels 1..n to nodes to maximize the sum over edges of the sums of their endpoint labels — equivalently maximize sum(degree[node] * label[node]). The optimal greedy strategy is to assign the largest labels to the highest-degree nodes.
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.