Assume a ranking system where each gives a rank to all competing teams from highest to lowest. The final ranking is decided on the basis of the number of first-place votes they receive. If there’s a tie for first place, the second-place votes are used to break the tie; if there’s still a tie, the third-place votes are considered, and this continues until all positions have been evaluated. If teams remain tied after all positions have been reviewed, they are ranked alphabetically by their team names.

Given an array of strings votes that represents the rankings given by all voters, sort the teams according to the specified ranking system and return a string that lists all the teams in the ranked order.

Constraints:

• $1 \leq$ votes.length $\leq 1000$

• $1 \leq$ votes[i].length $\leq 26$

• votes[i].length == votes[j].length for $0 \leq$ i, j $<$ votes.length

• votes[i][j] is an uppercase English letter.

• All characters of votes[i] are unique.

• All characters present in votes[0] are also found in votes[i] where $1 \leq$ i $<$ votes.length.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.