Good Pair

1 <= A.size() <= 10^4
1 <= A[i] <= 10^9
1 <= B <= 10^9

First argument is an integer array A.
Second argument is an integer B.

Return 1 if good pair exist otherwise return 0.

Input 1:
A = [1,2,3,4]
B = 7

Input 2:
A = [1,2,4]
B = 4

Input 3:
A = [1,2,2]
B = 4

Output 1:
1

Output 2:
0

Output 3:
1

Explanation 1:
(i,j) = (3,4)

Explanation 2:
No pair has sum equal to 4.

Explanation 3:
(i,j) = (2,3)

import java.util.HashSet;
 
public class GoodPair {
    public int solve(int[] A, int B) {
        HashSet<Integer> set = new HashSet<>();
        for (int num : A) {
            if (set.contains(B - num)) {
                return 1;
            }
            set.add(num);
        }
        return 0;
    }
}

def solve(A, B):
    seen = set()
    for num in A:
        if B - num in seen:
            return 1
        seen.add(num)
    return 0

function solve(A, B) {
    let set = new Set();
    for (let num of A) {
        if (set.has(B - num)) {
            return 1;
        }
        set.add(num);
    }
    return 0;
}