The Target Hunt

A medium Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

medium

Seniority

L5

Problem

A reconciliation job pairs up transaction amounts that offset to a fixed `target`. Given a list `nums` of integers and an integer `target`, return every `[x, y]` pair summing to `target`, where each list element belongs to at most one pair. A value repeated at different positions can take part in that many separate pairs, so `[1, 1, 2, 2]` with target 3 yields two `[1, 2]` pairs rather than one. List the earlier-positioned value first inside each pair, and return the pairs in the order their second (completing) element appears while moving through the list left to right.

Summary

Pairs that hit a target. Every one of them.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.