Skip to main content
All Questions

Given a tree, flag every node that is an endpoint of some longest path (diameter) in the tree.

Unlock detailed company stats for this questionUpgrade
Given a tree with n numbered nodes and its edge list, return an array of 0/1 flags, one per node, marking every node that is an endpoint of at least one longest path (diameter) in the tree.

Community answers

No answers contributed by the community yet.

Related questions

Print the cousins of a given node in a binary tree.Given the root of a binary tree, return the length of the diameter of the tree.

Related courses

Course

Behavioral Interviews: A Practical Guide for Engineers

Get offers at the level you deserve. Prep for senior+ behavioral interviews at FAANG and Tier-1 companies. Made with staff and principal engineers from Meta, Netflix, Google, and more. Avoid downleveling, elevate past projects, and stop sounding like a robot.

Course

Software Engineering Interview Prep

Land your dream software engineering role at Google, Amazon, Microsoft, Meta, Apple, and other top companies. Learn from mock interviews, frameworks, and advice from senior candidates—practice data structures, algorithms, system design, people management, behavioral interviews, and more.