# Find the first two transactions paired with every product that costs less than the transaction total

Canonical URL: <https://datadriven.io/problems/find-the-first-two-transactions-paired-with-every-product-th-7ccbb9d6>

Domain: SQL · Difficulty: medium

## Problem

Find the first two transactions paired with every product that costs less than the transaction total. This is an inequality join where the ON clause uses a > operator instead of =.

## Related

- [All practice problems](https://datadriven.io/problems)
- [Mock interview mode](https://datadriven.io/interview/find-the-first-two-transactions-paired-with-every-product-th-7ccbb9d6)
- [SQL Interview Questions](https://datadriven.io/sql-interview-questions)
- [Data Engineering Interview Prep Guide](https://datadriven.io/data-engineer-interview-prep)
- [Daily Challenge](https://datadriven.io/daily)

---

Source: DataDriven (https://datadriven.io). 100% free data engineering interview prep. Live code execution against Postgres 16, Python 3.11, and Spark sandboxes. No paywall, no premium tier, no signup gate.