Let 'N' = 5, 'G' = ['A', 'B', 'A', 'A', 'B'].
Team A has won 3 games, and Team B has won 2 games.
Therefore, the answer is "A".
The first line contains an integer 'N', the number of games.
The second line contains the array of characters 'G' of length 'N', representing the game outcomes.
Return a string representing the team with the most wins ("A" or "B") or "Tie" if both teams have the same number of wins.
You don’t need to print anything. Just implement the given function.
1 <= 'N' <= 10^5
Each character in 'G' will be either 'A' or 'B'.
Time Limit: 1 sec
Approach:
Algorithm: