Length of the Longest Path in an N-Ary Tree - Facebook Top Interview Questions
Problem Statement :
You are given a two-dimensional list of integers edges representing an n-ary tree.
Each element in edges contains [u, v] meaning that u is the parent of v.
Return the length of the longest path in the tree.
Constraints
1 ≤ n ≤ 100,000 where n is the length of edges
Example 1
Input
edges = [
[1, 2],
[1, 3],
[1, 4],
[4, 5]
]
Output
4
Solution :
Solution in C++ :
int solve(vector<vector<int>>& edges) {
int n = edges.size() + 1;
if (n == 1) return 0;
unordered_map<int, vector<int>> adj;
unordered_map<int, int> ind;
for (auto& e : edges) {
adj[e[1]].push_back(e[0]);
adj[e[0]].push_back(e[1]);
ind[e[0]] += 1;
ind[e[1]] += 1;
}
vector<int> leaves;
int dist = 0;
for (auto [element, indegree] : ind)
if (indegree == 1) leaves.push_back(element);
while (n > 2) {
vector<int> newleaves;
n -= leaves.size();
dist += 1;
for (auto k : leaves) {
ind[k] -= 1;
for (auto j : adj[k]) {
if (--ind[j] == 1) {
newleaves.push_back(j);
}
}
}
leaves = newleaves;
if (leaves.size() == 0) break;
}
if (n == 1) return dist * 2 + 1;
return 2 * dist + 2;
}
Solution in Java :
import java.util.*;
import java.util.stream.Collectors;
class Solution {
private Set<Integer> visited = new HashSet();
private Map<Integer, List<Integer>> graph = new HashMap();
private Map<Integer, Integer> degreeMap = new HashMap();
private int maxnodes = 0;
private Queue<int[]> queue = new LinkedList();
public int solve(int[][] edges) {
if (edges == null || edges.length == 0)
return 0;
for (int[] edge : edges) {
int u = edge[0];
int v = edge[1];
degreeMap.put(u, degreeMap.getOrDefault(u, 0) + 1);
degreeMap.put(v, degreeMap.getOrDefault(v, 0) + 1);
graph.computeIfAbsent(u, key -> new ArrayList()).add(v);
graph.computeIfAbsent(v, key -> new ArrayList()).add(u);
maxnodes = Math.max(maxnodes, u);
maxnodes = Math.max(maxnodes, v);
}
int level = 0;
while (degreeMap.size() > 2) {
level++;
List<Integer> peelNodes = degreeMap.keySet()
.stream()
.filter(key -> degreeMap.get(key) == 1)
.collect(Collectors.toList());
peelNodes.forEach(node -> {
if (graph.containsKey(node)) {
for (int adj : graph.get(node)) {
if (degreeMap.containsKey(adj)) {
degreeMap.put(adj, degreeMap.get(adj) - 1);
}
}
}
degreeMap.remove(node);
});
}
return 2 * level + degreeMap.size();
}
}
Solution in Python :
class Solution:
def solve(self, edges):
g = {}
for u, v in edges:
if u not in g:
g[u] = []
g[u] += (v,)
if v not in g:
g[v] = []
g[v] += (u,)
d = {}
def bfs(o):
d[o] = 1
f = o
q = [o]
for x in q:
for y in g[x]:
if y not in d:
d[y] = d[x] + 1
if d[y] > d[f]:
f = y
q += (y,)
return f
for o in g:
f = bfs(o)
d = {}
return d[bfs(f)]
break
return 0
View More Similar Problems
Fibonacci Numbers Tree
Shashank loves trees and math. He has a rooted tree, T , consisting of N nodes uniquely labeled with integers in the inclusive range [1 , N ]. The node labeled as 1 is the root node of tree , and each node in is associated with some positive integer value (all values are initially ). Let's define Fk as the Kth Fibonacci number. Shashank wants to perform 22 types of operations over his tree, T
View Solution →Pair Sums
Given an array, we define its value to be the value obtained by following these instructions: Write down all pairs of numbers from this array. Compute the product of each pair. Find the sum of all the products. For example, for a given array, for a given array [7,2 ,-1 ,2 ] Note that ( 7 , 2 ) is listed twice, one for each occurrence of 2. Given an array of integers, find the largest v
View Solution →Lazy White Falcon
White Falcon just solved the data structure problem below using heavy-light decomposition. Can you help her find a new solution that doesn't require implementing any fancy techniques? There are 2 types of query operations that can be performed on a tree: 1 u x: Assign x as the value of node u. 2 u v: Print the sum of the node values in the unique path from node u to node v. Given a tree wi
View Solution →Ticket to Ride
Simon received the board game Ticket to Ride as a birthday present. After playing it with his friends, he decides to come up with a strategy for the game. There are n cities on the map and n - 1 road plans. Each road plan consists of the following: Two cities which can be directly connected by a road. The length of the proposed road. The entire road plan is designed in such a way that if o
View Solution →Heavy Light White Falcon
Our lazy white falcon finally decided to learn heavy-light decomposition. Her teacher gave an assignment for her to practice this new technique. Please help her by solving this problem. You are given a tree with N nodes and each node's value is initially 0. The problem asks you to operate the following two types of queries: "1 u x" assign x to the value of the node . "2 u v" print the maxim
View Solution →Number Game on a Tree
Andy and Lily love playing games with numbers and trees. Today they have a tree consisting of n nodes and n -1 edges. Each edge i has an integer weight, wi. Before the game starts, Andy chooses an unordered pair of distinct nodes, ( u , v ), and uses all the edge weights present on the unique path from node u to node v to construct a list of numbers. For example, in the diagram below, Andy
View Solution →