Maximum of minimum for every window size - DataStructures/Stack

[sahil-13399]

Given an integer array. The task is to find the maximum of the minimum of every window size in the array.
Note: Window size varies from 1 to the size of the Array.

For example,

N = 7
arr[] = {10,20,30,50,10,70,30}

So the answer for the above would be : 70 30 20 10 10 10 10

We need to consider window sizes from 1 to length of array in each iteration. So in the iteration 1 the windows would be [10], [20], [30], [50], [10], [70], [30]. Now we need to check the minimum value in each window. Since the window size is 1 here the minimum element would be the number itself. Now the maximum out of these is the result in iteration 1.
In the second iteration we need to consider window size 2, so there would be [10,20], [20,30], [30,50], [50,10], [10,70], [70,30]. Now the minimum of each window size would be [10,20,30,10,10] and the maximum out of these is 30. Similarly we solve for other window sizes.

[sahil-13399]

Please assign me this issue I will solve it and provide proper documentation about it.