Project Engineer

There are ‘N’ students each having some amount of blue and black pens (including 0). All you have to do is to arrange them in such a way that students having fewer pens always come before the students having the greater number of pens. If two or more students having the same total number of pens then the one having more blue pens will come first.

For Example :

‘STUDENTS’ = [[2, 3], [5, 1], [1, 2], [4, 1]]
‘ANS’ = [[1, 2], [4, 1], [2, 3], [5, 1]]

Here, STUDENTS[i][0] and STUDENTS[i][1] represent the blue and black pens student ‘i’ have, respectively.
‘STUDENTS’ in terms of the total number of pens students have = [[5], [6], [3], [5]]
Arrange according to the requirement = [[3], [5], [5], [7]]. The fourth student will come before the first student as he has more blue pens.
Therefore, the final answer is [[1, 2], [4, 1], [2, 3], [5, 1]].

You are given an array 'ARR' of integers of length 'N' and a positive integer 'K'. You need to find the maximum elements for each and every contiguous subarray of size K of the array.

For example

'ARR' =  [3, 4, -1, 1, 5] and 'K' = 3
Output =  [4, 4, 5]

Since the maximum element of the first subarray of length three ([3, 4, -1]) is 4, the maximum element of the second subarray of length three ([4, -1, 1]) is also 4 and the maximum element of the last subarray of length three ([-1, 1, 5]) is 5, so you need to return [4, 4, 5]. 

given a set of four numbers that relate to each other in a certain way.
determine the missing number in the third set.
10 4 9 5 
8 5 15 3



7 6
? 2

Ninja has been asked to make the seating arrangement during the exam. Given an array ‘A’ of ‘N’ integers where ‘A[i] = 1’ means there is a student seated at the index ‘i’ and ‘A[i] = 0’ means that the place is currently unoccupied.

Provided no two students can seat adjacent to each other Ninjas has been asked to place extra ‘K’ students in the classroom.

Return 1 if the Ninja is able to place that extra ‘K’ student else return 0.

Example :

Input: ‘N’ = 7, ‘K’ = 2, ‘A’ = [1, 0, 0, 0, 1, 0, 0]
Output: 1

It is possible to place locations 2 and 6 (0-indexed) the updated array will be [1, 0, 1, 0, 1, 0, 1] Here no two students are adjacent to each other.