Debate League Standings and Divisions

Problem

A school debate league records each squad's season in `squad_records`. 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). 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.

Order the result by `score` descending, then by `squad_name` ascending.

Tables

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 (SQL)

SELECT *
FROM squad_records;

Related SQL questions

• 3-Day Tweet Rolling AverageMedium
• 7-Day vs 28-Day Rolling Avg DivergenceMedium
• A/B Test Sample Ratio Mismatch (SRM) CheckMedium
• Accounts Streaming From Two Devices at OnceMedium
• Ad Campaign Funnel AnalysisMedium
• Agent Resolution RateMedium