Solution: Rank Teams by Votes
Explore how to solve the Rank Teams by Votes problem by understanding and implementing a vote counting system using a 2D array. Learn to sort teams based on their rank votes and handle ties by comparing subsequent positions or alphabetical order, helping you grasp counting and sorting patterns valuable in coding interviews.
We'll cover the following...
Statement
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:
votes.length...