Tree Detection - Facebook Top Interview Questions
Problem Statement :
You are given two lists of integers left and right, both of them the same length and representing a directed graph. left[i] is the index of node i's left child and right[i] is the index of node i's right child. A null child is represented by -1. Return whether left and right represents a binary tree. Constraints n ≤ 100,000 where n is the length of left and right Example 1 Input left = [1, -1, 3, -1] right = [2, -1, -1, -1] Output True Example 2 Input left = [0] right = [0] Output False Explanation This is a circular node.
Solution :
Solution in C++ :
int count_nodes(int root, vector<int>& left, vector<int>& right) {
if (root == -1) return 0;
return 1 + count_nodes(left[root], left, right) + count_nodes(right[root], left, right);
}
bool solve(vector<int>& left, vector<int>& right) { // Time and Space: O(N)
// No cell can have indegree more than 1
int n = left.size();
vector<int> indeg(n, 0);
for (int i = 0; i < n; i++) {
if (left[i] != -1) {
if (++indeg[left[i]] > 1) return false;
}
if (right[i] != -1) {
if (++indeg[right[i]] > 1) return false;
}
}
// It has to have a root
int root = -1;
for (int i = 0; i < n; i++) {
if (indeg[i] == 0) {
root = i;
break;
}
}
if (root == -1) return false;
// It has to be connected
return count_nodes(root, left, right) == n;
}
Solution in Java :
import java.util.*;
class Solution {
private Map<Integer, List<Integer>> graph = new HashMap();
private Set<Integer> visited = new HashSet();
private Set<Integer> visiting = new HashSet();
private boolean isCycleFound = false;
public boolean solve(int[] left, int[] right) {
int vertices = left.length;
int[] inDegreeMap = new int[left.length];
boolean isZeroIndegreeNodeFound = false;
int rootVertex = -1;
for (int i = 0; i < left.length; i++) {
if (left[i] != -1) {
inDegreeMap[left[i]]++;
addEdge(i, left[i]);
}
if (right[i] != -1) {
inDegreeMap[right[i]]++;
addEdge(i, right[i]);
}
}
for (int i = 0; i < inDegreeMap.length; ++i) {
if (inDegreeMap[i] > 1)
return false;
if (inDegreeMap[i] == 0 && isZeroIndegreeNodeFound)
return false;
if (inDegreeMap[i] == 0 && !isZeroIndegreeNodeFound) {
isZeroIndegreeNodeFound = true;
rootVertex = i;
}
}
if (rootVertex == -1)
return false;
dfs(rootVertex);
return (!isCycleFound && visited.size() == vertices);
}
private void dfs(int vertex) {
visiting.add(vertex);
if (graph.containsKey(vertex)) {
for (int adjacentVertex : graph.get(vertex)) {
if (visiting.contains(adjacentVertex)) {
isCycleFound = true;
return;
}
dfs(adjacentVertex);
}
}
visiting.remove(vertex);
visited.add(vertex);
}
private void addEdge(int u, int v) {
List<Integer> adjList = graph.getOrDefault(u, new ArrayList());
adjList.add(v);
graph.put(u, adjList);
}
}
Solution in Python :
class Solution:
def solve(self, left, right):
N = len(left)
degs = [0] * N
for i in range(N):
if left[i] != -1:
degs[left[i]] += 1
if right[i] != -1:
degs[right[i]] += 1
q = deque(i for i in range(N) if degs[i] == 0)
if len(q) != 1:
return False
seen = set()
while q:
cur = q.popleft()
if cur in seen:
return False
seen.add(cur)
if left[cur] != -1:
q.append(left[cur])
if right[cur] != -1:
q.append(right[cur])
return len(seen) == N
View More Similar Problems
Queries with Fixed Length
Consider an -integer sequence, . We perform a query on by using an integer, , to calculate the result of the following expression: In other words, if we let , then you need to calculate . Given and queries, return a list of answers to each query. Example The first query uses all of the subarrays of length : . The maxima of the subarrays are . The minimum of these is . The secon
View Solution →QHEAP1
This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types: " 1 v " - Add an element to the heap. " 2 v " - Delete the element from the heap. "3" - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct element
View Solution →Jesse and Cookies
Jesse loves cookies. He wants the sweetness of all his cookies to be greater than value K. To do this, Jesse repeatedly mixes two cookies with the least sweetness. He creates a special combined cookie with: sweetness Least sweet cookie 2nd least sweet cookie). He repeats this procedure until all the cookies in his collection have a sweetness > = K. You are given Jesse's cookies. Print t
View Solution →Find the Running Median
The median of a set of integers is the midpoint value of the data set for which an equal number of integers are less than and greater than the value. To find the median, you must first sort your set of integers in non-decreasing order, then: If your set contains an odd number of elements, the median is the middle element of the sorted sample. In the sorted set { 1, 2, 3 } , 2 is the median.
View Solution →Minimum Average Waiting Time
Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h
View Solution →Merging Communities
People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w
View Solution →