Technical
Given an unsorted array of numbers (that may contain repeated numbers), print or produce a data structure that contains all the pairs that have a sum equal to a number k. Do not include pairs that are the same numbers in a different order.
Ex. [3,2,6,2,0,5,3,8,7,10]
[(0,10),(2,8),(3,7)]