Available question text
For each element in an array, find the largest contiguous subarray (range) in which that element is the maximum. This is typically solved by locating the nearest greater (or handling ties with greater-or-equal) neighbor to the left and right for each index—usually with monotonic stacks.
Related questions
Continue with questions that share topics or the same question type.
- The first was leetcode Set Matrix Zeroes.
The LeetCode problem Set Matrix Zeroes is a classic 2D array manipulation problem. The description is as follows:
You are given an
𝑚
×
𝑛
m×n matrix of integers. If any element is 0, you must set its entire row and column to 0. In other words, for each cell that contains 0, all cells in the same row and column should be changed to 0.
Coding
- Apply Transform Over Each Element in Array
Coding
- Count Ordered Four-Shop Road Paths That Visit One Shop of Each Type
Coding · Graphs
- Find Sorted Submatrices With Maximum Element at Most K
Coding
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 2832. Maximal Range That Each Element Is Maximum in It
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source