# Matrix Relations - Google Top Interview Questions

### Problem Statement :

```You are given an integer n and a two-dimensional list of integers relations.

You want to fill an n by n matrix using relations, which defines the spatial ordering of some cell values in the matrix. Each element relations[i] contains (x, y, type) which means that

x is left of y if type = 0

x is right of y if type = 1

x is above y if type = 2

x is below y if type = 3

Return the n by n matrix following the constraints in relations. Since some cells may not have a value,
set it to -1. You can assume each defined cell in the matrix will have a unique value. Also, there is one
unique solution.

Constraints

n ≤ 500

1 ≤ m ≤ 100,000 where m is the length of relations

Example 1

Input

n = 3

relations = [

[1, 2, 0],

[2, 3, 0],

[1, 2, 2],

[2, 3, 2]

]

Output

[

[1, -1, -1],

[-1, 2, -1],

[-1, -1, 3]

]

Explanation

The relations says:

1 is left of 2

2 is left of 3

1 is above 2

2 is above 3

Other unfilled squares are set to -1.```

### Solution :

```                        ```Solution in C++ :

vector<vector<int>> solve(int n, vector<vector<int>> &relations) {
unordered_map<int, vector<int>> left, above;
unordered_map<int, int> indegLeft, indegAbove;
unordered_map<int, pair<int, int>> mp;
for (int i = 0; i < relations.size(); i++) {
int x = relations[i], y = relations[i], type = relations[i];
mp[x] = {-1, -1};
mp[y] = {-1, -1};
if (type == 0 || type == 1) {
if (type == 1) {
swap(x, y);
}
left[y].push_back(x);
indegLeft[x]++;
indegLeft[y] = indegLeft[y];
} else {
if (type == 3) {
swap(x, y);
}
above[y].push_back(x);
indegAbove[x]++;
indegAbove[y] = indegAbove[y];
}
}

queue<int> q;
for (auto it = indegLeft.begin(); it != indegLeft.end(); it++) {
if (it->second == 0) {
q.push(it->first);
}
}

int j = n - 1;
while (!q.empty()) {
int s = q.size();
while (s--) {
int p = q.front();
q.pop();
mp[p].second = j;
vector<int> &l = left[p];
for (int i = 0; i < l.size(); i++) {
indegLeft[l[i]]--;
if (indegLeft[l[i]] == 0) {
q.push(l[i]);
}
}
}
j--;
}

for (auto it = indegAbove.begin(); it != indegAbove.end(); it++) {
if (it->second == 0) {
q.push(it->first);
}
}
int i = n - 1;
while (!q.empty()) {
int s = q.size();
while (s--) {
int p = q.front();
q.pop();
mp[p].first = i;
vector<int> &l = above[p];
for (int j = 0; j < l.size(); j++) {
indegAbove[l[j]]--;
if (indegAbove[l[j]] == 0) {
q.push(l[j]);
}
}
}
i--;
}

vector<vector<int>> res(n, vector<int>(n, -1));
for (auto it = mp.begin(); it != mp.end(); it++) {
int val = it->first;
int x = it->second.first, y = it->second.second;
res[x][y] = val;
}
return res;
}```
```

```                        ```Solution in Java :

import java.util.*;

class Solution {
public int[][] solve(int n, int[][] r) {
int[][] ans = new int[n][n];

// Initialize the matrix
for (int[] row : ans) {
Arrays.fill(row, -1);
}
Map<Integer, Set<Integer>> downTo = new HashMap<>();
Map<Integer, Set<Integer>> rightTo = new HashMap<>();
Map<Integer, Set<Integer>> upTo = new HashMap<>();
Map<Integer, Set<Integer>> leftTo = new HashMap<>();
Map<Integer, Integer> xaxis = new HashMap<>();
Map<Integer, Integer> yaxis = new HashMap<>();

for (int i = 0; i < r.length; i++) {
// I change all the right or below direction to left or above

if (r[i] == 1 || r[i] == 3) {
r[i]--;
int tmp = r[i];
r[i] = r[i];
r[i] = tmp;
}
int x = r[i];
int y = r[i];

// Build set if a map doesn't have the key.
rightTo.computeIfAbsent(x, k -> new HashSet<>());
rightTo.computeIfAbsent(y, k -> new HashSet<>());
leftTo.computeIfAbsent(x, k -> new HashSet<>());
leftTo.computeIfAbsent(y, k -> new HashSet<>());
downTo.computeIfAbsent(x, k -> new HashSet<>());
downTo.computeIfAbsent(y, k -> new HashSet<>());
upTo.computeIfAbsent(x, k -> new HashSet<>());
upTo.computeIfAbsent(y, k -> new HashSet<>());
if (r[i] == 0) {
// x left to y
} else {
// x up to y
}
}

// If degree is 0 then we add it to the queue
for (int k : rightTo.keySet()) {
if (rightTo.get(k).size() == 0) {
q.offer(k);
}
}
int idx = n - 1;
while (!q.isEmpty()) {
int size = q.size();
while (size > 0) {
size--;
int cur = q.poll();
// System.out.println(cur);
yaxis.put(cur, idx);
for (int p : leftTo.get(cur)) {
rightTo.get(p).remove(cur);
if (rightTo.get(p).size() == 0) {
q.offer(p);
}
}
}
idx--;
}

for (int k : downTo.keySet()) {
if (downTo.get(k).size() == 0) {
q.offer(k);
}
}
idx = n - 1;
while (!q.isEmpty()) {
int size = q.size();
while (size > 0) {
size--;
int cur = q.poll();
// System.out.println(cur);
xaxis.put(cur, idx);
for (int p : upTo.get(cur)) {
downTo.get(p).remove(cur);
if (downTo.get(p).size() == 0) {
q.offer(p);
}
}
}
idx--;
}

for (int key : xaxis.keySet()) {
ans[xaxis.get(key)][yaxis.get(key)] = key;
}

return ans;
}
}```
```

```                        ```Solution in Python :

class Solution:
def solve(self, N, relations):
rindegree = collections.Counter()
cindegree = collections.Counter()
rlist = collections.defaultdict(list)
clist = collections.defaultdict(list)
keys = set()

# Parsing queries
for x, y, t in relations:

if t == 0:
rindegree[y] += 1
rlist[x].append(y)
elif t == 1:
rindegree[x] += 1
rlist[y].append(x)

if t == 2:
cindegree[y] += 1
clist[x].append(y)
elif t == 3:
cindegree[x] += 1
clist[y].append(x)

# Get the rows (or cols) mapping of the indegree and list
def topsort(indegree, elist):
ans = {}
q = collections.deque()
for x in keys:
if indegree[x] == 0:
q.append((x, 0))

while len(q) > 0:
index, d = q.popleft()
ans[index] = d

for v in elist[index]:
if indegree[v] > 0:
indegree[v] -= 1
if indegree[v] == 0:
q.append((v, d + 1))
return ans

rans = topsort(rindegree, rlist)
cans = topsort(cindegree, clist)

ans = [[-1] * N for _ in range(N)]

for x in keys:
ans[cans[x]][rans[x]] = x

return ans```
```

## 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

## 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

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

## 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.

## 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

## 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