CPMagical CP Library

Problem solution · SQL

Investments in 2016

Investments in 2016: 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
13 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 Investments in 2016, 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

  • 13 lines of SQL from the credited upstream file 585.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.

Open problem ↗Original source ↗
Full codeInvestments in 2016 · SQLSQL
Use this to learn the idea, then write your own version.
WITH  InsuranceWithCounts AS (    SELECT      tiv_2016,      COUNT(*) OVER(PARTITION by tiv_2015) AS tiv_2015_count,      COUNT(*) OVER(PARTITION by lat, lon) AS city_count    FROM Insurance  )SELECT ROUND(SUM(tiv_2016), 2) AS tiv_2016FROM InsuranceWithCountsWHERE tiv_2015_count > 1  AND city_count = 1;

Keep practising

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 ↗