Subset Sum Problem!

Given an integer array A of size N.

You are also given an integer B, you need to find whether their exist a subset in A whose sum equal B.

If there exist a subset then return 1 else return 0.

1 <= N <= 100

1 <= A[i] <= 100

1 <= B <= 10⁵

First argument is an integer array A.

Second argument is an integer B.

Return 1 if there exist a subset with sum B else return 0.

Input 1:

 A = [3, 34, 4, 12, 5, 2]
 B = 9

Input 2:

 A = [3, 34, 4, 12, 5, 2]
 B = 30

Output 1:

 1

Output 2:

 0

Explanation 1:

 There is a subset (4, 5) with sum 9.

Explanation 2:

 There is no subset that add up to 30.