Breaking News: Grepper is joining You.com. Read the official announcement!

dynamic programming Subset Sum Problem algorithm Java

Wrong Willet answered on March 19, 2022 Popularity 8/10 Helpfulness 2/10

answer dynamic programming Subset Sum Problem algorithm Java

dynamic programming Subset Sum Problem algorithm Java

Comment

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];
}

Popularity 8/10 Helpfulness 2/10 Language whatever

Source: www.interviewbit.com

Tags: algorithm dynamic-programming java subset-sum whatever

Link to this answer
Share Copy Link