Digital Technology Intern

Given an array 'arr' with 'n' elements, the task is to rotate the array to the left by 'k' steps, where 'k' is non-negative.

Example:

'arr '= [1,2,3,4,5]
'k' = 1  rotated array = [2,3,4,5,1]
'k' = 2  rotated array = [3,4,5,1,2]
'k' = 3  rotated array = [4,5,1,2,3] and so on.

You are given a permutation of ‘N’ integers from 1 to ‘N’. You have to count the number of index ‘k’ such that on sorting these first ‘k’ indexes, you will get a subarray of ‘k’ integers having values from 1 to ‘k’.

For Example :

‘N’ = 5, ‘ARR’ = {3, 1, 2, 4, 5}.

Now in this example, There are three indexes 3, 4, 5(indexing starting from 1):
Sorted subarray(1, 3): 1, 2, 3.
Sorted subarray(1, 4): 1, 2, 3, 4.
Sorted subarray(1, 5): 1, 2, 3, 5.
Hence the answer is 3.

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.

Explain Final, Finally, and Finalize in Java (Learn)

How can we initialize the global variable in java? (Learn)

1. What are your strengths and weaknesses?
2. Will you be able to relocate?