GFG Subset Sum problem

 package com.company;

public class CWR_Gfg_SubsetSum {
    public static int subSet(int[] arr, int n, int sum) {

        if (sum == 0) {
            return 1;
        }
        int count = 0;
        for (int i = 0; i < n; i++) {
            for (int j = i + 1; j < n; j++) {
                if (arr[i] + arr[j] == sum) {
                    count++;
                }
            }
        }
        return count;
    }
//    Recursive solution for subset sum problem
    public static int subSet1(int [] arr, int n, int sum){
        if(n == 0){
       return (sum == 0) ? 1 : 0;
        }

        return subSet1(arr, n-1, sum) + subSet1(arr, n-1, sum -arr[n-1]);
    }

    public static void main(String[] args) {
        int[] A = {1, 1, 3};
        System.out.println(subSet1(A, 3, 1));
    }
}