A straightforward approach checks every pair of elements, but you can achieve better performance using a lookup structure.

Two Sum

easy

Acceptance: 57%

Arrays

You have an integer array and a target sum. Identify two distinct positions whose corresponding values add up to the target. Exactly one valid pair exists, and you must not reuse the same position. Return the pair of indices in any order.

Examples

Example 1:

Input:arr = [3,5,8,12], target = 13

Output:[0,2]

Explanation: The values at positions 0 and 2 are 3 and 8, which sum to the target of 13.

Example 2:

Input:arr = [4,1,6], target = 7

Output:[1,2]

Explanation: Position 1 holds 1 and position 2 holds 6; together they equal 7.

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Two Sum

Examples

Hints

Related Problems