SDE

There are ‘N’ cities in Pokeland, and they are connected by ‘N-1’ roads. It is possible to reach from any city to any other city and there is a unique path between each pair of cities.

Each city has one Pokemon represented by an integer between 1 and 10^9. In each city. Given queries in the form of pairs of cities ‘U’ and ‘V’, find the number of Pokemon Ash catches while traveling from city ‘U’ to ‘V’. If he already has a Pokemon ‘X’ and he comes across it again, he does NOT catch it.

Note: Each query is independent, that is, he starts each query with zero Pokemon.

You are given a binary tree whose each node is associated with some integer value. You have to break this tree into two parts by removing exactly one edge. You also have to maximise the product of the sum of the integers associated with each node in both parts.

For Example:

Consider the above example, if we break the tree by removing the edge between nodes that has integers 5 and 6 then we get the maximum product of the sum of integers on nodes i.e. ( (6 + 4 + 1) * (5 + 1 + 3 + 2) ) = 121.

Note:

The answer may be very large so, you have to take the modulo with 10^9 + 7.

There is a kingdom with ‘N’ cities that are connected by roads. The cities are connected to form a tree, where cities represent the nodes, and the roads represent the edges. The cities are numbered from 0 to ‘N-1’ and the length of each road is 1 unit.

A tree is a hierarchical data structure defined as a collection of nodes.

Now, a battle is going on in some cities of the kingdom, where the king must visit to restore peace. Initially, the king is at the 0th node(root node). The cities where battles are going on will be given as an input array, and the king has to visit in the same order as given in the input array 'battles'. You have to find the total length of the road the king has to travel to restore peace in all the cities.

For Example:

For the test case:
N = 3, Q = 2
Edge 1 connects 0 and 1
Edge 2 connects 0 and 2
battles = [1, 2]

The king has to visit first city 1 and then city 2. To visit city 1, he has to travel 1 unit, and now he is in city 1. To visit city 2 from city 1, he has to travel another 2 units. So overall, he has to travel 3 units of distance.

You are given four points on a two-dimensional coordinate system.

Can you check if those four points make a square?

Example:

Let the input be [1,0,2,1] and [0,1,1,2].
So, the coordinates of the four points be [ {1, 0}, {0, 1}, {2, 1}, {1, 2} ]

From the above image, we can see that it is a square. Thus, the output will be ‘Yes’.

Print the following pattern

Pattern for N = 4

1
23
345
4567

1. Tell me about yourself. 
2. Why are you interested in this position? 
3. Why are you leaving your current job? 
4. Can you describe a work or school instance in which you messed up? 
5. Tell me about a time when you experienced conflict with a co-worker and how you dealt with it?