Two-Sum Index Tuples | Dataford Interview Questions

Valence workspace analytics needs to identify every pair of numeric entries that reaches a specified target. Given an integer array nums and an integer target, return all index pairs (i, j) such that i < j and nums[i] + nums[j] == target.

You must not reuse the same array element. Include every valid pair, including pairs formed from duplicate values. Return pairs in the order discovered while scanning from left to right: pairs with the smaller right index appear first, and pairs sharing the same right index are ordered by their left index.

Formal Specification

Input: nums, a list of integers, and target, an integer.
Output: A list of two-element tuples (i, j), using zero-based indices.
Return an empty list when no valid pair exists.

Constraints

2 <= len(nums) <= 10^5
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
Every pair must use distinct indices
The output can contain O(n^2) pairs

Function Signature

def all_target_pairs(nums, target):

Your question is Two-Sum Index Tuples. Start with the requirements 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.

Problem

Formal Specification

Input: nums, a list of integers, and target, an integer.
Output: A list of two-element tuples (i, j), using zero-based indices.
Return an empty list when no valid pair exists.

Constraints

2 <= len(nums) <= 10^5
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
Every pair must use distinct indices
The output can contain O(n^2) pairs

Function Signature

def all_target_pairs(nums, target):

Your question is Two-Sum Index Tuples. Start with the requirements 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.