Write a function that takes in an array of integers, which can be both positive and negative, along with a target integer. The function should return all unique pairs of integers from the array that sum up to the target integer. def find_pairs_with_sum(arr: List[int], target: int) -> List[Tuple[int, int]]: pass Inputs The inputs are defined as follows: arr: A list of integers containing both positive and negative numbers. The array may have duplicate values. target: An integer that we are interested in finding pairs for. Output Return a list of tuples, where each tuple contains a pair of integers that sum up to the target integer. Example Tests find_pairs_with_sum([3, 4, 2, 5], 7) should return [(3, 4), (2, 5)] find_pairs_with_sum([2, 4, 1, 5], 9) should return [(4, 5)] find_pairs_with_sum([7, 1, 2, 3, 4, -2], 5) should return [(1, 4), (2, 3), (7, -2)]

Q: All Pairs

from typing import List, Tuple, Set def find_pairs_with_sum(arr: List[int], target: int) -> List[Tuple[int, int]]: # Initialize an empty set to store unique pairs result_set = set() # Create a set for quick lookups complementary_set = set() # Iterate through the array to find pairs that sum up to the target for num in arr: complement = target - num if complement in complementary_set: # Sort the pair (smaller, larger) before adding to result set for uniqueness result_set.add(tuple(sorted((num, complement)))) complementary_set.add(num) # Convert the set to a list of tuples return list(result_set) # Test the function with the given test cases test_cases = [ ([3, 4, 2, 5], 7), ([2, 4, 1, 5], 9), ([7, 1, 2, 3, 4, -2], 5) ] for arr, target in test_cases: print(f"find_pairs_with_sum({arr}, {target}) = {find_pairs_with_sum(arr, target)}")

Complete Training For Your Trading Interview

Interview Questions Programming All Pairs

Write a function that takes in an array of integers, which can be both positive and negative, along with a target integer. The function should return all unique pairs of integers from the array that sum up to the target integer.

def find_pairs_with_sum(arr: List[int], target: int) -> List[Tuple[int, int]]:

    pass

Inputs
The inputs are defined as follows:

arr: A list of integers containing both positive and negative numbers. The array may have duplicate values.
target: An integer that we are interested in finding pairs for.

Output
Return a list of tuples, where each tuple contains a pair of integers that sum up to the target integer.

Example Tests

find_pairs_with_sum([3, 4, 2, 5], 7) should return [(3, 4), (2, 5)]
find_pairs_with_sum([2, 4, 1, 5], 9) should return [(4, 5)]
find_pairs_with_sum([7, 1, 2, 3, 4, -2], 5) should return [(1, 4), (2, 3), (7, -2)]

from typing import List, Tuple, Set



def find_pairs_with_sum(arr: List[int], target: int) -> List[Tuple[int, int]]:

    # Initialize an empty set to store unique pairs

    result_set = set()

    

    # Create a set for quick lookups

    complementary_set = set()

    

    # Iterate through the array to find pairs that sum up to the target

    for num in arr:

        complement = target - num

        if complement in complementary_set:

            # Sort the pair (smaller, larger) before adding to result set for uniqueness

            result_set.add(tuple(sorted((num, complement))))

        complementary_set.add(num)

    

    # Convert the set to a list of tuples

    return list(result_set)



# Test the function with the given test cases

test_cases = [

    ([3, 4, 2, 5], 7), 

    ([2, 4, 1, 5], 9), 

    ([7, 1, 2, 3, 4, -2], 5)

]



for arr, target in test_cases:

    print(f"find_pairs_with_sum({arr}, {target}) = {find_pairs_with_sum(arr, target)}")

Python scratchpad

# Run Python right here in your browser
def two_sum(nums, target):
    seen = {}
    for i, n in enumerate(nums):
        if target - n in seen:
            return [seen[target - n], i]
        seen[n] = i
    return []

print(two_sum([2, 7, 11, 15], 9))  # [0, 1]

Run Python in your browser

Write and execute code — numpy, pandas & scikit-learn included — right on the question page.

My Notes

Notes are saved in this browser only. Sign up to keep them in your account.

Related Questions (16)

Title	Category	Subcategory	Difficulty	Status
All Permutations	Programming	Array and List Processing	Medium	Unlock
Arithmetic Mean	Programming	Array and List Processing	Hard	Unlock
Binary Search Tree (BST)	Programming	Array and List Processing	Hard	Unlock
Counting Inversions	Programming	Array and List Processing	Hard	Unlock
Crate Loading	Programming	Array and List Processing	Easy	Unlock
Find the Missing Number	Programming	Array and List Processing	Easy	Unlock
Finding the Largest Possible Number	Programming	Array and List Processing	Easy	Unlock
Longest Common Subsequence (LCS)	Programming	Array and List Processing	Medium	Example
Longest Increasing Subsequence	Programming	Array and List Processing	Hard	Unlock
Majority Element	Programming	Array and List Processing	Medium	Unlock
Maximum Subarray Sum	Programming	Array and List Processing	Medium	Unlock
Search a Rotated Array	Programming	Array and List Processing	Medium	Unlock
Settling Array	Programming	Array and List Processing	Medium	Unlock
Sorting Without Sort()	Programming	Array and List Processing	Hard	Unlock
Subarray Sum Equals Zero	Programming	Array and List Processing	Medium	Unlock
Sudoku	Programming	Array and List Processing	Hard	Unlock

Discussion (1)

Please log in to see the discussion.

Back to all Questions

The Interview Guide for Quants and Traders

All Pairs

What do you think of this page?