Problem Submissions Solution
Max of min for every window
Difficulty: Hard
Acceptance: %
Points: 40.00
Given an array of integers arr[], the task is to find the maximum of the minimum values for every possible window size in the array, where the window size ranges from 1 to arr.size().
More formally, for each window size k, determine the smallest element in all windows of size k, and then find the largest value among these minimums where 1<=k<=arr.size().
Examples:
NA
Constraints:
- 1 <= arr.size() <= 105
- 1 <= arr[i] <= 106
Companies:
Amazon Microsoft Flipkart
Topics:
Stack
