|All-time Popular Problems|
|Minimum Depth of a Binary Tree|
|Even and odd elements at even and odd positions|
|Egg Dropping Puzzle|
|Find first set bit|
|Recursively remove all adjacent duplicates|
|Queue using two Stacks|
|Find the Odd Occurence|
|Longest Palindrome in a String|
|Maximum sum increasing subsequence|
Write a program to find the majority element in the array. A majority element in an array A of size n is an element that appears more than n/2 times (and hence there is at most one such element). If input array doesn't contain a majority element, then output "NO Majority Element"
Input: The first line of the input contains T denoting the number of testcases. The first line of the test case will be the size of array and second line will be the elements of the array.
Output: For each test case the output will be the majority element of the array.
1 <=T<= 100
1 <=N<= 100
0 <= a[i]<= 100
3 1 3 3 2
1 2 3
NO Majority Element