LeetCode 503. Next Greater Element II

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.