N065-H2 Tier 5 · Expert · hard analytics · Streamhub

Return each session's `id`, the `user_id` it belongs to, its `started_at`, and its `visit_number` — `1` for the user's earliest session, `2` for their second, and so on

Part of Sessionization and Funnel Analysis Patterns in SQL

The problem

Scenario: Streamhub's product team is mapping each session to a user's visit history to understand how session behavior changes over time.

Task: Write a query to return each session's id, the user_id it belongs to, its started_at, and its visit_number1 for the user's earliest session, 2 for their second, and so on.

Assumptions:

  • Within a user's history, sessions are ordered by started_at ascending.
  • A session's visit_number is its position in the chronological sequence of sessions for the same user, starting at 1 for the earliest session.

Output:

  • One row per session.
  • Columns in this order: session_id, user_id, started_at, visit_number.
  • Sorted by user_id ascending, then started_at ascending.
Schema · analytics 5 tables
users
id integer
name text
email text
country text
plan text
signed_up_at timestamptz
is_active boolean
conversions
id integer
user_id integer
converted_at timestamptz
plan text
amount numeric
sessions
id integer
user_id integer
started_at timestamptz
ended_at? timestamptz
event_count integer
events
id integer
user_id integer
session_id? integer
event_type text
occurred_at timestamptz
properties? jsonb
periods
id integer
name text
start_month integer
end_month integer

Run previews · Check grades

Write a query, then run it to see results here.

Worked solution Try it yourself first
Solution query
SELECT
  id AS session_id,
  user_id,
  started_at,
  COUNT(*) OVER (
    PARTITION BY
      user_id
    ORDER BY
      started_at
  ) AS visit_number
FROM
  sessions
ORDER BY
  user_id,
  started_at

The shape

A user's visit_number is just the chronological position of their session inside their own history, which is exactly what a running COUNT(*) produces when partitioned by user_id and ordered by started_at. No CTE is needed; the window function does the work in a single pass.

Clause by clause

  • SELECT id AS session_id, user_id, started_at returns the three identifying columns, with id renamed to session_id to match the requested output.
  • COUNT(*) OVER (PARTITION BY user_id ORDER BY started_at) AS visit_number is the load-bearing piece. With PARTITION BY user_id, the count restarts for each user. With ORDER BY started_at, PostgreSQL applies the window's default frame — rows from the partition start up through the current row's ordering peer group — which makes the count advance by one with each later session. The result is 1, 2, 3, ... in chronological order per user.
  • FROM sessions reads every session row.
  • ORDER BY user_id, started_at matches the requested sort and aligns with the window's reading order.

Why this and not ROW_NUMBER() OVER (...)

ROW_NUMBER() would give the same 1, 2, 3, ... sequence on this data and is the more idiomatic choice for a "position in order" question. The reason COUNT(*) OVER (...) works identically here is that started_at is unique per user in the sessions table, so each row is its own peer group inside the window's ordering and the running count advances by exactly one. If two sessions for the same user shared a started_at, COUNT(*) OVER would give both the higher number (tied peers count together in the default range frame), while ROW_NUMBER would still break the tie arbitrarily.

The trap

Forgetting PARTITION BY user_id is the silent failure. The window would still run, ordered globally by started_at, and the count would advance across all users as one stream. User 1's first session might come back as visit 12 because eleven other users had earlier sessions, which would look plausible until someone cross-checked. The partition is what restarts the counter at every new user.

You practiced numbering ordered partitions with a running count over (PARTITION BY user_id ORDER BY started_at) — equivalent to ROW_NUMBER, with the position resetting at each user boundary.

How you actually get good at SQL

Reading explains SQL. Writing it, over and over with instant feedback, is what makes you fluent.

That's the whole SQLMaxx loop: 600+ real problems, instant AI feedback, mastery you can actually see, and spaced review that won't let you forget.

A stack of SQL practice problem cards, the top card showing an employees table.
615 problems · 66 concepts

Real problems. Not toy examples.

615 hand-built problems spanning all 66 concepts, from basic SELECTs to window functions, built on real schemas and real business questions, the kind you'll actually get asked on the job. Enough reps to make SQL automatic.

A retro computer showing a SQL query marked correct with a green checkmark.
Instant AI feedback

Write a query. Know if it's right in one second.

No copying an answer and hoping it clicked. The AI grader checks your real query against real data, catches exactly what's wrong, and explains the fix in plain English, like a senior analyst reading over your shoulder on every problem.

A circular mastery progress dial filling from blue to green, the SQLMaxx diamond at its center.
Mastery tracking

Stop guessing whether you actually know it.

SQLMaxx tracks every concept and shows you what you've mastered and what's still shaky. Your skills fill in one concept at a time, so 'I think I get joins' becomes something you can prove.

A SQL query editor circled by a blue return arrow with a clock, scheduled to come back for review.
Spaced review

Learn it once. Keep it for good.

Most of what you learn this week fades by next week. So when a concept comes due for review, SQLMaxx hands you a fresh problem to solve from a blank editor, not a flashcard to re-read. A research-backed spaced-repetition algorithm (FSRS) times each return for right before you'd forget, so your SQL is still there months later, when the interview or the job actually needs it.

Practice, feedback, mastery, review. That's the loop that turns reading into real skill.

Start free

No account, no credit card. Start solving in under a minute.