static void calculateMaximumRevenue(int[] noOfProducts, int[] | CODING SOLUTION - Placement Jobs & Materials

static void calculateMaximumRevenue(int[] noOfProducts, int[] sellingPriceOfProducts, int transportableProdCount) {
System.out.println(helper(noOfProducts, sellingPriceOfProducts, transportableProdCount));
}

private static int helper(int[] numOfProds, int[] sellingPrices, int spaceLeft) {
int max = 0;
for (int i = 0; i < numOfProds.length; ++i) {
int numProds = numOfProds[i];
if (spaceLeft < numProds) {
continue;
}
int price = sellingPrices[i] + helper(Arrays.copyOfRange(numOfProds, i, numOfProds.length), Arrays.copyOfRange(sellingPrices, i, sellingPrices.length), spaceLeft - numProds);
if (price > max) {
max = price;
}
}
return max;
}

Java
Plastic Bag code
Telegram - t.me/codingsolution_IT




int prefsum[][] = new int[N][];
for (int i = 0; i < n; i++) {
for (int x = 0; x < m; x++) {
if (x == 0)
prefsum[i][x] = damage[i][x];
else
prefsum[i][x]
= prefsum[i][x - 1] + damage[i][x];
}
}

int dp[][] = new int[n][M + 1];
for (int dpp[] : dp)
Arrays.fill(dpp, Integer.MIN_VALUE);
for (int i = 0; i < n; i++)
dp[i][0] = 0;
for (int i = 1; i <= Math.min(m, M); ++i) {
dp[0][i] = dp[0][i - 1] + grid[0][i - 1];
}

for (int i = 1; i < n; ++i) {
for (int j = 1; j <= M; ++j) {
dp[i][j] = dp[i - 1][j];
for (int x = 1; x <= Math.min(j, m);
x++) {
dp[i][j]
= Math.max(dp[i][j],
dp[i - 1][j - x]
+ prefsum[i][x - 1]);
}
}
}
return dp[n - 1][M];

Java
Newspaper slot Code
Telegram - t.me/codingsolution_IT