X DAYS

:

HOUR

:

MINS

:

SEC

Copied to Clipboard
Contest Score
Easy Accuracy: 66.01% Submissions: 1322 Points: 2

Geek participated in a contest for N consecutive days. The score of each day is given by an array arr, the task is to find the nearest Score which is less than the ith (1 <= i <= N) day's score in the days from i+1 to N. If no days exist with a smaller score then print -1.

Input:
1. The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
2. The first line of each test case contains a single integer N.
3. Next N lines contain N space-separated integers.

Output: For each test case, N space-separated integers.

Constraints:
1. 1 <= T <= 100

2. 1 <= N <= 104
3. 1 <= arr[i] <= 109

Example:
Input:

2
3
5 4 2

5
2 5 6 3 9

Output:
2 3 -1
-1 4 4 -1 -1

Explanation:
Test Case 1: The Nearest score smaller than 1st day's score is 4, which is at index 2. The Nearest score smaller than 2st day's score is 2, which is at index 3. There does not exists a score less than 3rd day.

### Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

#### My Submissions:  