SDE - Intern

No one knows about Ninja, what he is thinking and what he wants to do. Now Ninja asks for the family tree from his father. His family tree is in the form of a binary tree and each node ( or we can say a family member ) is mentioned with some integer. Now his father asks him to write a code so that he is able to calculate the sum of all child nodes with even grandparents, that is, the grandparents node with an even integer value.

So your task is to calculate the sum of values of all nodes that have even valued grandparents. Grandparents refer to the parent of the parent node or we can say the two levels above node is a grandparent node.

Example :

Consider the following binary tree :

So the sum of child nodes having even valued grandparents is ‘4 + 8 + 1 + 9 + 2 = 24’

Ninja is assigned a task to deliver some boxes which contain different units having different weights. With the help of his truck, he will earn money on the basis of the number of units of boxes he will deliver by his truck. Ninja truck has some capacity on the number of boxes he can put on his truck.

So your task is to find a way so that ninja will choose boxes in a way that units will be maximum and he would be able to get more money you will be provided with an array of ‘BOX’, where BOX[i] = [countofBoxes, unitsperBox].

CountofBoxes represents the number of boxes of the same type i.e containing the units of the same value.

UnitsperBox represents the number of units in the box or we simply say that unit value.

And an integer ‘K’ denoting the limit of boxes on the truck.

If TENNIS is coded as UDOMJR, then CRICKET is coded as:
(a) DPJBMDV
(b) DQJBMEU
(c) DQJBLDU
(d) BSHDJFS

If JUDGE is coded as UJDEG then ORDER is coded as?/
a. RODRE b. REDRO c. RODER d. REDOR

The given signs denote the following operations/relationships: A>B means A is 3 times of B AUB means B is 3 times of A A/B means A is less than B A*B means A is equal to B Which of the two conclusions 1 and 2 is/are definitely true based on the information provided? STATEMENTS H>I, JUT and J/K CONCLUSIONS 1.1/K 2. H > 3J​

AGD: EKH :: IOL:
MSP
NTR
MSP
NTO​

I BHE: FLI: Jpm.
a) OTP_ENTRO O NSP d) OS​

A total of 512 players participated in a single tennis knock out tournament. What is the total number of matches played in the tournament? (Knockout means if a player loses, he is out of the tournament). No match ends in a tie.

A. 511
B. 512
C. 256
D. 255
E. 1023

What is the area enclosed in the region defined by y = |x – 1| + 2, line x = 1, X–axis and Y–axis?

In how many ways can 6 boys be allotted into 5 rooms such that no room is empty and all 6 boys are accommodated?

A. 27
B. 720
C. 840
D. 900
E. 1800

3L of milk are drawn from a container containing 30L of milk. It is replaced by water and the process is repeated 2 times. What is the ratio of milk to water at the end?

A. 729271
729
271

B. 743229
743
229

C. 8119
81
19

D. 2187100
2187
100

E. 81319

A, B and C can do a work in 20 days. They worked together for 8 days, then A left the work and B and C finished the remaining work in 20 days. In how many days will A alone do the work?

A) 45 days

B) 50 days

C) 55 days

D) 65 days

You are a product manager and currently leading a team to develop a new version of a product. Unfortunately, the latest version you are working on fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad.

Suppose you have an array of N versions [1, 2, ..., N] and you want to find out the first bad version, which causes all the succeeding versions to be bad.

Consider we have a function isBadVersion(version), this will return whether the version is bad or not.

For an example, suppose n = 5, and version = 4 is the first bad version. So if the isBadVersion(3) returns false, isBadVersion(5) returns true and isBadVersion(4) also returns true, then the first bad version is 4.

You should minimize the number of calls to the API.

Note :

bool isBadVersion(version) returns true for all versions ‘V’ such that V > X, where X is the first bad version.

You are given a matrix ‘MAT’ of dimensions ‘N x N’. Let’s define a sequence to be ‘zigzag’ if it starts from the top and ends at the bottom such that no two consecutive elements of the sequence belong to the same column.

Your task is to find the sum of the zigzag sequence with the largest sum.