|All-time Popular Problems|
|Check if subtree|
|Print BST elements in given range|
|Angle between hour and minute hand|
|Remove duplicate element from sorted Linked List|
|Smallest Positive missing number|
|Remove loop in Linked List|
|Find median in a stream|
|n'th node from end of linked list|
|Check for BST|
Given an array, return second largest element from an array.
The first line of input contains an integer T denoting the number of test cases.
The first line of each test case is N,N is the size of array.
The second line of each test case contains N input C[i].
Print the second largest element.
1 ≤ T ≤ 50
1 ≤ N ≤ 500
1 ≤ C[i] ≤ 1200
89 24 75 11 23
56 42 21 23 65 20