Available question text
Given a rooted tree with coin values, decide for each node whether to collect coins as coins[i]-k or as floor(coins[i]/2), where choosing the latter also halves every coin in its subtree (and multiple ancestor halvings stack), to maximize total points when all nodes must be collected. This requires a tree DP that tracks the propagated halving state along root-to-node paths (bounded by O(log(max coin))) to evaluate optimal choices.
Related questions
Continue with questions that share topics or the same question type.
- Find the Maximum Ancestor Value Across All Leaf Nodes in a Binary Tree
Coding
- Find the Minimum and Maximum Number of Nodes Between Critical Points
Coding
- Maximum Coins From K Consecutive Bags
Coding · Array · Binary Search · Greedy
- Maximum Number of Points From Grid Queries
Coding · Array · Breadth-First Search · Heap (Priority Queue)
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 2920. Maximum Points After Collecting Coins From All Nodes
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source