Available question text
Given a tree where you can collect all coins within distance 2 of your current node and may move along edges, find the minimum number of edge-traversals needed to collect all coins and return to your start. The challenge is to trim irrelevant subtrees and compute the minimal round-trip traversal of the remaining core tree (typically solved by iterative leaf-pruning and a tree-diameter-style reduction).
Related questions
Continue with questions that share topics or the same question type.
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 2603. Collect Coins in a Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source