Available question text
Given a rooted tree with a value on each node, for every node return the nearest ancestor whose value is coprime with the node's value (or -1 if none). The challenge is to traverse the tree while efficiently tracking the most recent ancestor indices for each possible value (nums[i] ≤ 50) so you can quickly find the closest coprime ancestor.
Related questions
Continue with questions that share topics or the same question type.
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Average of Levels in Binary Tree
Coding
- Balance a Binary Search Tree
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 1766. Tree of Coprimes
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source