Jump Queries on a Tree
Filed under Atlassian
The question
Given a general tree of n nodes where each node's value is its node number, process q queries. For each query starting at a given node, jump a fixed amount towards the root repeatedly (e.g., 3rd ancestor, 6th ancestor) until unable to jump further. The jump value is guaranteed to be <= 10.
No write-up yet. Related questions below have one.
Related Atlassian questions
Collected from public candidate posts and coding forums. Updated Nov 2026.