SDE - 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 an array/list of integers of length ‘N’, there is a sliding window of size ‘K’ which moves from the beginning of the array, to the very end. You can only see the ‘K’ numbers in a particular window at a time. For each of the 'N'-'K'+1 different windows thus formed, you are supposed to return the maximum element in each of them, from the given array/list.

What type of language is JavaScript?
== vs === in JavaScript?
Arrow functions definition.
Normal functions in JS.
How to declare an arrow function?
A small coding exercise to be solved only in JS
How to empty an array in JS?
Some Questions from Computer Networks :
What happens when we hit www.google.com?
Explain OSI model.
then he asked some OOPS questions like inheritance, polymorphism, and encapsulation.
Finally He asked me to code an example of polymorphism.