Back to challenges
Medium 0 solved 0% acceptance

Tournament Standings

Rank teams from match records.

What you'll learn

  • Parse match results from text
  • Aggregate points per team in a dictionary
  • Sort by points, then by name

Problem

Rank teams from match records. Each record has the form First;Second;result, with no extra spaces. Result is win, loss, or draw from First’s perspective. A win earns 3 points, a draw earns 1 per team, and a loss earns 0. Count matches played, wins, draws, losses, and points for each team that appears. Sort by descending points, then ascending team name (ASCII order).

Return one semicolon-separated row per team: Name;Played;Won;Drawn;Lost;Points. Do not include a header or alignment spaces.

Implement tournament_standings(matches).

Input

matches: Match records, in any order.

Output

Return ranked rows with the six fields described above. Write numbers without leading zeros.

Constraints

0…10,000 valid records. Team names contain 1…30 ASCII letters and are case-sensitive. Each match has two different names. Repeated matches are separate games. Empty input gives an empty result.

Examples

Example 1
Input:
matches = ["Falcons;Bears;win", "Bears;Owls;draw"]

Expected output:
expected = ["Falcons;1;1;0;0;3", "Bears;2;0;1;1;1", "Owls;1;0;1;0;1"]
Input:
std::vector<std::string> matches = {"Falcons;Bears;win", "Bears;Owls;draw"};

Expected output:
std::vector<std::string> expected = {"Falcons;1;1;0;0;3", "Bears;2;0;1;1;1", "Owls;1;0;1;0;1"};
Input:
string[] matches = new string[] {"Falcons;Bears;win", "Bears;Owls;draw"};

Expected output:
string[] expected = new string[] {"Falcons;1;1;0;0;3", "Bears;2;0;1;1;1", "Owls;1;0;1;0;1"};

Explanation

Falcons have 3 points from their win. Bears and Owls each have 1 point from the draw, so Bears come first alphabetically. Bears played twice and lost once.

Example 2
Input:
matches = ["Zebras;Ants;loss"]

Expected output:
expected = ["Ants;1;1;0;0;3", "Zebras;1;0;0;1;0"]
Input:
std::vector<std::string> matches = {"Zebras;Ants;loss"};

Expected output:
std::vector<std::string> expected = {"Ants;1;1;0;0;3", "Zebras;1;0;0;1;0"};
Input:
string[] matches = new string[] {"Zebras;Ants;loss"};

Expected output:
string[] expected = new string[] {"Ants;1;1;0;0;3", "Zebras;1;0;0;1;0"};

Explanation

Loss is from Zebras’ perspective: Ants won and receive 3 points. Zebras receive 0.

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

Accumulate stats for every team seen in the match list, even if it only loses.

Hint 2

Each record updates two teams at once, and the result is always from the first team's perspective.

Hint 3

After collecting totals, sort by points descending and then by team name ascending.

Expected complexity

O(m log t) time, O(t) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.