Answer: Pinterest SWE Interview Question 2024 June | Monotonic Stack | on-campus

Solution: Next Greater Element II — Monotonic Stack Approach To solve this in O(N) time, we use a **Monotonic Stack**. The stack stores the indices of elements whose next greater element has not yet been found. The elements in the stack are sorted in descending order of their corresponding values in nums. To simulate the circular nature of the array, we iterate through the array twice (using indices from 0 to 2 * N - 1 and mapping them back ...