dynamic programming Subset Sum Problem algorithm Java
static boolean isThereSubsetSum(int arr[], int n, int sum) {
boolean dp[][] = new boolean[n + 1][sum + 1];
for (int i = 0; i <= n; i++)
dp[i][0] = true;
for (int i = 1; i <= sum; i++)
dp[0][i] = false;
for (int i = 1; i <= sum; i++) {
for (int j = 1; j <= n; j++) {
if (j < arr[i - 1])
dp[i][j] = dp[i - 1][j];
if (j >= arr[i - 1])
dp[i][j] = dp[i - 1][j] ||
dp[i - 1][j - arr[i - 1]];
}
}
return dp[n][sum];
}