# Given nums = [1, 2, 3, 4, 5], write an O(n^2) pair sum that prints every i + j where i and j are dis

Canonical URL: <https://datadriven.io/problems/given-nums-1-2-3-4-5-write-an-on2-pair-sum-that-80fa9b0b>

Domain: Python · Difficulty: medium

## Problem

Given nums = [1, 2, 3, 4, 5], write an O(n^2) pair sum that prints every i + j where i and j are distinct elements and i < j. Print each pair and its sum on one line like '1+2=3'.

## Related

- [All practice problems](https://datadriven.io/problems)
- [Mock interview mode](https://datadriven.io/interview/given-nums-1-2-3-4-5-write-an-on2-pair-sum-that-80fa9b0b)
- [Python Interview Questions](https://datadriven.io/python-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.