Available question text
Given a tree and a marking process (e.g., initial marked nodes or rules for mark propagation along edges), determine which nodes become marked last; the core challenge is computing arrival times on a tree efficiently (multi-source BFS/Dijkstra or tree DP) and returning the nodes with maximum mark time.
Related questions
Continue with questions that share topics or the same question type.
- Find Number of Coins to Place in Tree Nodes
Coding
- Find Path Between Nodes in a Fibonacci Tree
Coding
- Find the Maximum Ancestor Value Across All Leaf Nodes in a Binary Tree
Coding
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
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 3313. Find the Last Marked Nodes in Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source