Dataford
Interview QuestionsInterview GuidesExperiencesMock InterviewsPricing
Get started
Optimizing SQL Windows and Joins
00:00
5 left

Optimizing SQL Windows and Joins

HardSQL · PostgreSQL

Problem

How do you optimize complex window functions and joins in high-volume SQL databases? Provide a PostgreSQL query that returns the latest qualifying transaction for each active account, including accounts without a qualifying transaction. Keep filtering as early as practical and make the result deterministic.

Output

  1. One row per active account, with account_id, customer_name, branch_name, latest_credit_date, and latest_credit_amount.
  2. Include accounts with no qualifying transaction, represented by NULL transaction columns.
  3. Return the latest positive CREDIT transaction on or after 2025-01-01; break same-date ties by the greatest txn_id.
  4. Order by account_id ascending.

Schema

accounts
ColumnTypeDescription
account_idPKINTUnique account identifier
customer_nameVARCHAR(100)Account holder name
branch_idINTReferenced branch identifier
statusVARCHAR(20)Account status
branches
ColumnTypeDescription
branch_idPKINTUnique branch identifier
branch_nameVARCHAR(100)Branch display name
transactions
ColumnTypeDescription
txn_idPKINTUnique transaction identifier
account_idINTReferenced account identifier
txn_dateDATETransaction posting date
amountDECIMAL(12,2)Transaction amount
txn_typeVARCHAR(20)Transaction category
Tablesaccountsbranchestransactions
Interviewer

Your question is Optimizing SQL Windows and Joins. Start with the requirements and the three tables in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.
CodePostgreSQL
You need to log in / sign up to run or submit.Ln 1
Run your query to see results here.