Debate League Standings and Divisions

Problem

A school debate league keeps each squad's season in a DataFrame `squad_records` loaded from `squad_records.csv`. Each row has a `squad_id`, a `squad_name`, the number of `rounds_debated`, and counts of `wins`, `splits`, and `losses`.

Scoring gives 3 points per win and 1 point per split; losses score nothing. For each squad compute its `squad_name`, total `score`, and `placement` — the ranking by score from highest to lowest using standard competition ranking (ties share a placement and the next placement skips positions, i.e. `rank(method="min")`). Then assign a `division` based on placement relative to the number of squads N: the top third (placement at or below CEIL(N * 0.33)) is 'Division A', the next third (placement at or below CEIL(N * 0.66)) is 'Division B', and the remainder is 'Division C'. A placement that lands exactly on a boundary goes to the higher division.

Return a DataFrame with columns `squad_name`, `score`, `placement`, `division`, ordered by `score` descending, then by `squad_name` ascending.

Input data

Example rows — the live problem includes the full dataset.

Expected output

Your answer should return 5 rows with the columns squad_name, score, placement, division.

Starter code (Pandas (Python))

import pandas as pd

def squad_standings(squad_records) -> pd.DataFrame:
    # Your code here
    return squad_records

Related Pandas questions

• 7-Day Rolling Signup AverageMedium
• Accounts Streaming From Two Devices at OnceMedium
• Agent Resolution RateMedium
• Agents With a Dominant Contact ChannelMedium
• Airbnb Popularity Bucket PricingMedium
• Amazon Unique Shipments per MonthMedium