Available question text
Given an m x n matrix where adjacent cells differ, find any cell that is strictly greater than its up/down/left/right neighbors (a 2D peak). Do this in O(m log n) or O(n log m) time — typically via divide-and-conquer/binary search across rows or columns to locate a peak.
Related questions
Continue with questions that share topics or the same question type.
- Find Peak Element
Coding · Array · Binary Search
- Find First and Last Position of Element in Sorted Array
Coding · Array · Binary Search
- Find Next Greater Element in Sorted Array
Coding
- Find Occurrences of an Element in an Array
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 1901. Find a Peak Element II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source