Find the Winner Problem Statement

Given an array/list VOTES containing names of candidates, where each entry represents the vote received by the candidate.

You need to determine the candidate with the maximum votes. In the event of a tie, return the lexicographically smaller name.

Input:

The first line contains an integer ‘T’ representing the number of test cases. Each test case consists of:

1. An integer ‘N’ indicating the total votes cast. 2. Followed by ‘N’ lines, each containing the name of a candidate who received a vote.

Output:

For each test case, output the name of the candidate who won the maximum number of votes. Print each result on a new line.

Example:

Input:

2
3
Alice
Bob
Alice
2
Charlie
Charlie

Output:

Alice
Charlie

Explanation:

In the first test case, Alice receives more votes than Bob. In the second test case, Charlie receives both votes.

Constraints:

• 1 ≤ T ≤ 50
• 1 ≤ N ≤ 10^3
• 1 ≤ |NAME| ≤ 20 where |NAME| represents the candidate's name length.