I think it is easy to understand this famous problem without much explanation
input:
x= 3
array = [4 5 2 8 2 4 1 ]
explanation:
4 5 2 min. element = 2
5 2 8 min. element = 2
2 8 2 " = 2
8 2 4 " =2
2 4 1 " = 1
result = max(2,2,2,2,1) = 2
input:
x= 3
array = [4 5 2 8 2 4 1 ]
explanation:
4 5 2 min. element = 2
5 2 8 min. element = 2
2 8 2 " = 2
8 2 4 " =2
2 4 1 " = 1
result = max(2,2,2,2,1) = 2
Maximum of minimum of all windows of length K?
Yup right