Available question text
Given a circular integer array, for each element find the first greater value encountered when traversing right (wrapping around the array circularly), or return -1 if no such greater element exists. This is a next-greater-element problem typically solved with a monotonic decreasing stack, iterating through the array twice to handle the circular wrap-around efficiently.
Related questions
Continue with questions that share topics or the same question type.
- Find Next Greater Element in Sorted Array
Coding
- Next Greater Element I
Coding · Array · Hash Table · Monotonic Stack
- Next Greater Element III
Coding
- Next Greater Element IV
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
Waymo
LeetCode 503. Next Greater Element II
Reported Apr 30, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source