Senior Software Engineer

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.

1) Explain the difference between process, program and a thread.
2) Explain virtualisation.
3) Do we use virtualisation in everyday computers, if so how?
4) What are some commonly used page scheduling algorithms ?
5) Explain the difference between LRU and MRU algorithms?

Ninja loves playing with numbers. One day Alice gives him some numbers and asks him to find the Kth largest value among them.

You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.

Note:

We cannot use the element at a given index twice.

Follow Up:

Try to do this problem in O(N) time complexity. 

1) Explain normalisation.
2) Difference between foreign and candidate key.
3) Difference between BCNF and 3NF.
4) Memory Protection in OS 
5) Explain pipelining.