Problem solution · SQL

Human Traffic of Stadium

Human Traffic of Stadium: a SQL solution using relational aggregation. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Relational aggregation
Source
walkccc LeetCode Solutions
Length
20 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Relational aggregation

For Human Traffic of Stadium, the query transforms and combines relational rows, then filters or aggregates them into the requested result.

  1. Identify the source rows and join keys.
  2. Apply filters before aggregation when possible.
  3. Group, rank, or project the final columns required by the result.

Code notes

  • 20 lines of SQL from the credited upstream file 601-2.sql.
  • The implementation keeps its working state in language-native values and containers.
  • No explicit loop blocks detected.

Complexity

Review join cardinality, grouping keys, and available indexes when estimating query cost.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Full codeHuman Traffic of Stadium · SQLSQL
Use this to learn the idea, then write your own version.
WITH  StadiumWithGroupId AS (    SELECT      id,      visit_date,      people,      id - ROW_NUMBER() OVER(ORDER BY id) AS group_id    FROM Stadium    WHERE people >= 100  )SELECT id, visit_date, peopleFROM StadiumWithGroupIdWHERE group_id IN (    SELECT group_id    FROM StadiumWithGroupId    GROUP BY group_id    HAVING COUNT(*) >= 3  )ORDER BY visit_date; 

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗