Available question text
For each node, choose up to k neighbors with the largest values (excluding negative contributions) and compute the star sum as the node's value plus those neighbors; return the maximum such sum over all nodes. With n and edges up to 1e5, this requires aggregating neighbor values and selecting top-k contributions efficiently.
Related questions
Continue with questions that share topics or the same question type.
- Maximum Sum of Edge Values in a Graph
Coding
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Choose K Elements With Maximum Sum
Coding
- Difference Between Maximum and Minimum Price Sum
Coding
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 2497. Maximum Star Sum of a Graph
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source