How should I practice Tree Diameter?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Qualcomm online assessment problems in FastPrep.

Is Tree Diameter associated with Qualcomm?

FastPrep tags this as a Qualcomm coding interview or online assessment practice problem when the problem catalog has that company context.

Problem · Tree

Tree Diameter

Learn this problem

● MediumQualcommFULLTIMEPHONE SCREEN

Problem statement

You are given an array edges describing an undirected tree. Each entry edges[i] = [u, v] represents an edge between nodes u and v.

The diameter of a tree is the number of edges in its longest path between any two nodes.

Return the diameter of the tree.

Function

treeDiameter(edges: int[][]) → int

Examples

Example 1

edges = [[0,1],[0,2]]return = 2

The longest path is 1 - 0 - 2, which contains 2 edges.

Example 2

edges = [[0,1],[1,2],[2,3],[1,4],[4,5]]return = 4

One longest path is 3 - 2 - 1 - 4 - 5, which contains 4 edges.

Example 3

edges = []return = 0

An empty edge list represents a one-node tree, whose longest path has 0 edges.