SDE - 1

You are given an array ‘ARR’ consisting of ‘N’ integers. Your task is to make all the numbers equal. You decrease one of the largest numbers present in the array into a number that is just lower than the maximum number in one step.

For example:

You are given ‘ARR’ = [5, 2, 3]
In the first step, you can change 5 to 3, so the new array is [3, 2,3].

In the second step, you can change the 3 to 2, then the array is [2, 2,3].

In the third step, you can change the 3 to 2, then the array is [2, 2, 2] 

Hence the answer is 3.

We have to write a query for the test case asked. It is a general query which one can practice from coding ninjas guided path for dbms.

I don't exactly remember this question. But it was to write code to fetch data from given url and then perform some operations on that data to give required results. It was something related to http requests.

You have given a sorted array 'A' of 'N' integers.

Now, you are given 'Q' queries, and each query consists of a single integer 'X'. Your task is to check whether 'X' is present in array 'A' or not for each query. If 'X' exists in array 'A', you need to print 1 else print 0.

Note :

The given array is sorted in non-decreasing order. 

You are given an n-ary tree consisting of ‘N’ nodes. Your task is to return the maximum sum of the path from the root to the leaf node.

For example:

For the given tree:

The path 1 -> 3 -> 7 produces the maximum i.e, 11.

Given a 4 digit number, when it is multiplied by 4 the answer is reverse of original number. What is/are the possible number(s)?

I was asked to describe my internship project and my college project too. Then there were some general discussions. Some behavioural questions like : "Describe any event in your life after which your perspective towards life changed completely." and "Some example of leadership skills that you have shown in past."