SDE - Intern

The question was that there are n bombs having some sizes. In the subsequent time - top two stones collide with each other, the smaller stone is destroyed completely and bigger stone's size is reduced by size of smaller stone. What will be the size of last stone.

The height of a tree is equal to the number of nodes on the longest path from the root to a leaf.

You are given an arbitrary binary tree consisting of 'n' nodes where each node is associated with a certain value.

Find out the height of the tree.

Example :

Input: Let the binary tree be:

Output: 2

Explanation: The root node is 3, and the leaf nodes are 1 and 2.

There are two nodes visited when traversing from 3 to 1.
There are two nodes visited when traversing from 3 to 2.

Therefore the height of the binary tree is 2.

You are given a tree with ‘N’ nodes and ‘N-1’ edges. Your task is to determine the tree's maximum height when we consider any arbitrary node as a root.

For Example:

N = 4
Edges = [2 3], [4 3], [1 3]

Output: 2

Here node 4 is at a distance 2 from node 1 and if we make node 1 as a root, it will give the height of 2, which is the maximum possible in this tree.

You are given a positive integer ‘n’.

Your task is to find and return its square root. If ‘n’ is not a perfect square, then return the floor value of sqrt(n).

Example:

Input: ‘n’ = 7

Output: 2

Explanation:
The square root of the number 7 lies between 2 and 3, so the floor value is 2.

Why should I hire you?

If I give you a project on pascal , would you agree to take it?

What is your goal in life?

What are your strengths and weaknesses?