SDE - Intern

Which of the following is not the type of queue?

Priority queue

Single-ended queue

Circular queue

Ordinary queue

void solve() {  

 int a[] = {1, 2, 3, 4, 5};   int sum = 0;   for(int i = 0; i < 5; i++) {       if(i % 2 == 0) {           sum += a[i];       }   }   cout << sum << endl;}

What is the disadvantage of array data structure

void solve() {  

 stack s;   s.push(1);   s.push(2);   s.push(3);   for(int i = 1; i <= 3; i++) {       cout << s.top() << “ “;       s.pop();   }}3 2 11 2 331

You are given an array 'a' of size 'n'.

Print the Next Greater Element(NGE) for every element.

The Next Greater Element for an element 'x' is the first element on the right side of 'x' in the array, which is greater than 'x'.

If no greater elements exist to the right of 'x', consider the next greater element as -1.

For example:

Input: 'a' = [7, 12, 1, 20]

Output: NGE = [12, 20, 20, -1]

Explanation: For the given array,

- The next greater element for 7 is 12.

- The next greater element for 12 is 20. 

- The next greater element for 1 is 20. 

- There is no greater element for 20 on the right side. So we consider NGE as -1.

Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.

Example :

Merge Sort Algorithm -

Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.

The above illustrates shows how merge sort works.

Note :

It is compulsory to use the ‘Merge Sort’ algorithm.

You have been given an array/list ‘arr’ of length ‘N’, which contains single digit elements at every index. Your task is to return the sum of all elements of the array. But the final sum should also be a single digit.

To keep the output single digit - you need to keep adding the digits of the output number till a single digit is left.

For example:

For the given array [5, 8, 4, 9]

The sum of the elements of the array will be
5 + 8 + 4 + 9 = 26.
Since 26 is not a single-digit number, we will again take the sum of the digits of 26. 
2 + 6 = 8.
Now 8 is a single-digit number. So we will stop here and return 8.

Ques 1 : Diff b/w list and linked list?
Ques 2 : Design Stack and queue from starting
Ques 3 : Where we use linked list in real life
Ques 4 : Why linked list exists?

1. What is deadlock?
2. What is protocol?
3. How to identify deadlock?
4. How can we remove deadlock?
5. Suppose you are using a laptop and it got stuck in between how do you identify its a deadlock state or not?

Tell me about yourself. 
Why do you want to work for our company? 
What are your greatest strengths and weaknesses?