Leaders in an Array Problem Statement

Given a sequence of numbers, the task is to identify all the leaders within this sequence. An element is considered a leader if it is strictly greater than all the elements to its right.

Note:

• The rightmost element is always considered a leader.
• The order of leaders in the result sequence should retain the original order from the given sequence.

Example:

Input:

The given sequence is 13, 14, 3, 8, 2

Output:

14, 8, 2

Explanation:

• 13 is not a leader because 14 is greater than 13 to its right.
• 14 is a leader because no element to its right is greater.
• 3 is not a leader because 8 is greater than 3 to its right.
• 8 is a leader because no element to its right is greater.
• 2 is a leader because it is the rightmost element in the sequence.

Input:

The first line of the input contains an integer ‘T’ denoting the number of test cases.
The first line of each test case contains an integer ‘N’ denoting the number of elements in the sequence.
The second line of each test case contains ‘N’ space-separated integers representing the sequence elements.

Output:

For each test case, print a sequence of all identified leaders separated by spaces, each output sequence on a new line.

Constraints:

• 1 ≤ T ≤ 50
• 1 ≤ N ≤ 10⁴
• -10⁹ ≤ ELEMENTS[i] ≤ 10⁹
• Time limit: 1 second

Note:

No need to print anything; the task requires just implementing the specified function.