In this problem, you'll be given a list of positive integers and a separate integer, K...

Transcribed Image Text:

In this problem, you'll be given a list of positive integers and a separate integer, K and tasked with finding whether there is a pair of integers in the list that sums to exactly K Implementation Implement the method findSumPair(numbers, k) which takes as Input: a list of positive integers (numbers) a positive integer (R), representing the target sum. For example: numbers (1, 5, 8, 1, 21 13 Your findSumPair method should return a list of two integers, containing the indices of a pair of integers in the list that sums to k. Note that: The first index of the list is 0. The first integer you return should represent the lower index. [0, 0]] should be returned if no pair is found. In the case that there are multiple possible pairs that sum to the target, return the pair whose left index is the lowest. • In the case of two pairs having the same left index, favor the pair wit the lower right index. For the above example, the correct return value would be: [[1, 2] Implementation Function Implement the method findSumPoir. Parameters numbers (List<Integer>): An array of positive integers. Ont): An Integer. O Return value twoindices (List<Integer»): An array with two integers. Constraints 0 numberal Available RAM: 512MB In this problem, you'll be given a list of positive integers and a separate integer, K and tasked with finding whether there is a pair of integers in the list that sums to exactly K Implementation Implement the method findSumPair(numbers, k) which takes as Input: a list of positive integers (numbers) a positive integer (R), representing the target sum. For example: numbers (1, 5, 8, 1, 21 13 Your findSumPair method should return a list of two integers, containing the indices of a pair of integers in the list that sums to k. Note that: The first index of the list is 0. The first integer you return should represent the lower index. [0, 0]] should be returned if no pair is found. In the case that there are multiple possible pairs that sum to the target, return the pair whose left index is the lowest. • In the case of two pairs having the same left index, favor the pair wit the lower right index. For the above example, the correct return value would be: [[1, 2] Implementation Function Implement the method findSumPoir. Parameters numbers (List<Integer>): An array of positive integers. Ont): An Integer. O Return value twoindices (List<Integer»): An array with two integers. Constraints 0 numberal Available RAM: 512MB