Available question text
Count the number of contiguous subarrays whose maximum element lies in the inclusive range [left, right].
Solve efficiently with a linear scan by counting subarrays with max ≤ right minus those with max < left (i.e., sliding-window/segment counting).
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 795. Number of Subarrays with Bounded Maximum
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source