Available question text
Given an array, compute for every window size k (1..n) the maximum value among the minimums of all contiguous subarrays of length k. The efficient solution derives, for each element, the range of window sizes where it is the subarray minimum (using previous/next smaller spans, e.g., a monotonic stack) and uses that to populate the results in O(n).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1950. Maximum of Minimum Values in All Subarrays
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source