Code Room
CodingMedium
Question
Given a circular array, for each element find the next strictly greater element when scanning forward (wrapping around the end). Return an array where answer[i] is that next greater value, or -1 if none exists. Constraints: 1 <= n <= 10^4, -10^9 <= nums[i] <= 10^9.
Implement
next_greater_circular(nums: list[int]) → list[int]Examples
in
[[1,2,1]]out[2,-1,2]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
Learn the concepts
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.
Run or narrate your approach, then ask the coach.