Python Sum of Pairs Codewars Solution requires optimization
your solution first maps all of the numbers, and then check for pairs.
what if, for instance, the list of numbers is very long, and the first two items already sum up to the desired sum?
I think that the optimal solution would iterate over the list only once.