# Second Place - Amazon Top Interview Questions

### Problem Statement :

```Given a binary tree root, return the depth of the second deepest leaf. Note that if there are multiple deepest leaves, the second deepest leaf is the next highest one.

The root has a depth of 0 and you can assume the answer is guaranteed to exist for the trees given.

Constraints

n ≤ 100,000 where n is the number of nodes in root.

Example 1

Input

root = [1, [2, null, null], [3, [4, [6, null, null], null], [5, null, [7, null, null]]]]

Output

1

Explanation

The the second deepest leaf is 2 which exists at depth 1```

### Solution :

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

int solve(Tree* root) {
queue<Tree*> q;
q.push(root);

int depth = 0;
int deepest = 0;
int res = 0;
while (!q.empty()) {
int n = q.size();
while (n--) {
Tree* t = q.front();
q.pop();

if (t->left == t->right) {
if (depth > deepest) {
res = deepest;
deepest = depth;
} else if (depth > res and depth < deepest)
res = depth;
}

if (t->left) q.push(t->left);
if (t->right) q.push(t->right);
}
depth++;
}

return res;
}```
```

```                        ```Solution in Java :

import java.util.*;

/**
* public class Tree {
*   int val;
*   Tree left;
*   Tree right;
* }
*/
class Solution {
int max1 = -1, max2 = -1;

public void dfs(Tree root, int depth) {
if (root == null)
return;
this.dfs(root.left, depth + 1);
this.dfs(root.right, depth + 1);
if (root.left == null && root.right == null)
if (depth == max1)
return;
else if (depth > max1) {
max2 = max1;
max1 = depth;
} else if (depth > max2)
max2 = depth;
}

public int solve(Tree root) {
dfs(root, 0);
return max2;
}
}```
```

```                        ```Solution in Python :

class Solution:
def solve(self, root):
depths = set()

def dfs(node, d=0):
if node:
if not node.left and not node.right:
dfs(node.left, d + 1)
dfs(node.right, d + 1)

dfs(root)
return max(depths)```
```

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

## Components in a graph

There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu