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
Array Pairs
Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .
View Solution →Self Balancing Tree
An AVL tree (Georgy Adelson-Velsky and Landis' tree, named after the inventors) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. We define balance factor for each node as : balanceFactor = height(left subtree) - height(righ
View Solution →Array and simple queries
Given two numbers N and M. N indicates the number of elements in the array A[](1-indexed) and M indicates number of queries. You need to perform two types of queries on the array A[] . You are given queries. Queries can be of two types, type 1 and type 2. Type 1 queries are represented as 1 i j : Modify the given array by removing elements from i to j and adding them to the front. Ty
View Solution →Median Updates
The median M of numbers is defined as the middle number after sorting them in order if M is odd. Or it is the average of the middle two numbers if M is even. You start with an empty number list. Then, you can add numbers to the list, or remove existing numbers from it. After each add or remove operation, output the median. Input: The first line is an integer, N , that indicates the number o
View Solution →Maximum Element
You have an empty sequence, and you will be given N queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. 3 -Print the maximum element in the stack. Input Format The first line of input contains an integer, N . The next N lines each contain an above mentioned query. (It is guaranteed that each
View Solution →Balanced Brackets
A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). A matching pair of brackets is not balanced if the set of bra
View Solution →