Reference no: EM131601365

Programming assignment: program in java.

2-Sum problem:

Given an unsorted array of integers A = {2, 13, 8, 38, 63, 9, 11, 4, 1, 3}
and a target sum Sum = 17

Goal: Using a hash implementation, determine if there exists two integers x, y in A such that x + y = Sum

Assume that there is only one solution to the sum.

If such integers are found, your solution should output the Sum and the two integers x and y. If not found, your solution should output
the string "Target sum not found" concatenated with the target sum.