Delete Mid Element from Stack Problem Statement

You are provided with a stack "ARR" containing "N+1" elements. Your task is to delete the middlemost element so that the resulting stack contains "N" elements.

Example:

Input:

ARR = [1, 2, 3, 4, 5], N = 4

Output:

ARR = [1, 2, 4, 5]

Explanation:

In the example above, the stack has an odd number of elements. Therefore, the middle element is the ((N+1)/2)th element, which is removed in the output.

Input:

ARR = [5, 6, 7, 8], N = 3

Output:

ARR = [5, 7, 8]

Explanation:

In this example, the stack has an even number of elements. Among the two middle elements, we remove the one which appears first. Thus, the middle element is the ((N+1)/2 - 1)th element, which is 6 and is removed in the output.

Input:

The first line contains an integer 'T' representing the number of test cases. For each test case, the first line contains an integer 'N', where 'N+1' indicates the number of elements in the stack initially. The second line contains 'N+1' space-separated integers representing the stack elements.

Output:

For each test case, print 'N' space-separated integers representing the stack elements after removing the middle element. Each test case's output should be printed on a separate line.

Constraints:

• 1 <= T <= 100
• 1 <= N+1 <= 3000
• 0 <= data <= 10⁹
• Time limit: 1 second

Note: You do not need to print anything; the function should only return the required result.