Premium

#414 Finding a Pair with a Given Sum

Companies:
VK
Themes:
AlgorithmsHash TablesPractice

Write a function whose first argument is an array of positive unordered numbers and whose second argument is a positive number.

The function must return true if the array contains two numbers whose sum equals the second argument: 

// Input:  ([10, 15, 3, 7], 17)
// Output: true

public class Template4 {
    public static boolean hasPairWithSum(int[] numbers, int target) {
        // TODO
        return false;
    }
}

Question review

Mentor
Answer as you would in a real interview. I’ll ask follow-up questions, then compare your answer with the reference answer and show your accuracy as a %.
Sign in to start the dialogue The mentor keeps the context of the current question and your previous messages.
Sign in