Preceding superior element II

Question

Preceding superior element II Given a circular array arr, write a function to return a new array containing the preceding superior element of each element present in arr. Since the array is circular, to find the preceding superior element, you could look circularly to the right until you find an element or reach the same element. If there is no superior element for a value, then the answer to that query is -1. Example 1 > - **Input:** arr = [2, 5, 1, 6, 10, 3] > - **Output:** [3, 10, 5, 10, -1, 10] > - **Explanation:** Preceding superior element for each element of arr is given below: > - arr[0] = 2, after visiting the array circularly, we find the superior element for this value in arr = 3 > - arr[1] = 5, after visiting the array circularly, we find the superior element for this value in arr = 10 > - arr[2] = 1, superior element for this value in arr = 5 > - arr[3] = 6, after visiting the array circularly, we find the superior element for this value in arr = 10 > - arr[4] = 10, there is no superior element for this value in arr, even after circularly visiting the array, so the result is -1 > - arr[5] = 3, superior element for this value in arr = 10 Example 2 > - **Input:** arr = [6, 7, 8, 9, 8] > - **Output:** [8, 8, 9, -1, 9] > - **Explanation:** Preceding superior element for each element of arr is given below: > - arr[0] = 6, after visiting the array circularly, we find the superior element for this value in arr = 8 > - arr[1] = 7, after visiting the array circularly, we find the superior element for this value in arr = 8 > - arr[2] = 8, after visiting the array circularly, we find the superior element for this value in arr = 9 > - arr[3] = 9, there is no superior element for this value in arr, even after circularly visiting the array, so the result is -1 > - arr[4] = 8, superior element for this value in arr = 9

Accepted Answer

Optimal Solution: Time Complexity O(N), Space Complexity O(1). Codeintuition provides an interactive coding environment for this problem.