Given three arrays height[], width[], and length[] of size n, where height[i], width[i], and length[i] represent the dimensions of a box. The task is to create a stack of boxes that is as tall as possible, but we can only stack a box on top of another box if the dimensions of the 2-D base of the lower box are each strictly larger than those of the 2-D base of the higher box.
Note:
- We can rotate a box so that any side functions as its base.
- It is also allowable to use multiple instances of the same type of box.
- The base of the lower box should be strictly larger than that of the new box we're going to place. This is in terms of both length and width, not just in terms of area. So, two boxes with the same base cannot be placed one over the other.
Example:
Input: height[] = [4, 1, 4, 10], width[] = [6, 2, 5, 12], length[] = [7, 3, 6, 32]
Output: 60
Explanation: One way of placing the boxes is as follows in the bottom to top manner: (Denoting the boxes in (l, w, h) manner)
(12, 32, 10) (10, 12, 32) (6, 7, 4)
(5, 6, 4) (4, 5, 6) (2, 3, 1) (1, 2, 3)
Hence, the total height of this stack is 10 + 32 + 4 + 4 + 6 + 1 + 3 = 60.
No other combination of boxes produces a height greater than this.
Input: height[] = [1, 4, 3], width[] = [2, 5, 4], length[] = [3, 6, 1]
Output: 15
Explanation: One way of placing the boxes is as follows in the bottom to top manner: (Denoting the boxes in (l, w, h) manner)
(5, 6, 4) (4, 5, 6) (3, 4, 1), (2, 3, 1)
(1, 2, 3).
Hence, the total height of this stack is 4 + 6 + 1 + 1 + 3 = 15
No other combination of boxes produces a height greater than this.
Main Idea
The Box Stacking problem is a variation of LIS problem. The main idea is to maximize the height of the stack by considering all possible orientations of the boxes and find the optimal stacking order. For each box, we generate all six possible rotations by treating each dimension as the height once, and the remaining two dimensions as the base dimensions (width and depth). By doing this, we account for all possible orientations and allow multiple instances of the same box type in different orientations.
We then sort these box rotations by their length and breath in descending order, ensuring that smaller boxes are only placed on larger ones. We compute the maximum stack height for each box as the base by iterating through all prior boxes and checking if they can be stacked. This approach ensures that we evaluate all valid stacking combinations efficiently and find the maximum height achievable.
Using Recursion - O(n^n) Time and O(n) Space
The idea is to recursively compute the maximum stack height starting from each box in all its possible orientations.
For a given box i with a particular orientation, the recursive relation is based on two conditions:
- We check if the current box i can be placed on top of any previously considered box j, meaning the base of box i must be strictly smaller than the base of box j.
- We compute the maximum stack height by choosing the best possible prior box to place under box i.
The recurrence relation can be written as:
- maxHeight[i] = max(height[i] + maxHeight[j] for all boxes j where base of box i > base of box j)
Here, maxHeight[i] represents the maximum height of the stack starting with box i in its current orientation. The recurrence works by checking all possible box placements and taking the maximum value among them, ensuring that the box stack grows in height as much as possible.
The base case is that a box by itself contributes a stack height of height[i], i.e., maxHeight[i] = height[i], when no boxes can be placed under it.
C++
// C++ program to implement
// box stacking problem
#include <bits/stdc++.h>
using namespace std;
// Function to find the maximum height
// with box i as base.
int maxHeightRecur(int i, vector<vector<int>> &boxes) {
int ans = boxes[i][2];
// Check all the next boxes
for (int j = i + 1; j < boxes.size(); j++) {
// If size of box j is less than
// size of box i.
if (boxes[i][0] > boxes[j][0] && boxes[i][1] > boxes[j][1]) {
ans = max(ans, boxes[i][2] + maxHeightRecur(j, boxes));
}
}
return ans;
}
int maxHeight(vector<int> &height, vector<int> &width, vector<int> &length) {
int n = height.size();
// Create a 2d array to store all
// orientations of boxes in (l, b, h)
// manner.
vector<vector<int>> boxes;
for (int i = 0; i < n; i++) {
int a = height[i], b = width[i], c = length[i];
boxes.push_back({a, b, c});
boxes.push_back({a, c, b});
boxes.push_back({b, a, c});
boxes.push_back({b, c, a});
boxes.push_back({c, a, b});
boxes.push_back({c, b, a});
}
// Sort the boxes in descending
// order of length and width.
sort(boxes.begin(), boxes.end(), greater<vector<int>>());
int ans = 0;
// Check for all boxes starting as base.
for (int i = 0; i < boxes.size(); i++) {
ans = max(ans, maxHeightRecur(i, boxes));
}
return ans;
}
int main(){
vector<int> height = {4, 1, 4, 10};
vector<int> width = {6, 2, 5, 12};
vector<int> length = {7, 3, 6, 32};
cout << maxHeight(height, width, length);
return 0;
}
// Java program to implement
// box stacking problem
import java.util.*;
class GfG {
// Function to find the maximum height
// with box i as base.
static int maxHeightRecur(int i, int[][] boxes) {
int ans = boxes[i][2];
// Check all the next boxes
for (int j = i + 1; j < boxes.length; j++) {
// If size of box j is less than
// size of box i.
if (boxes[i][0] > boxes[j][0] && boxes[i][1] > boxes[j][1]) {
ans = Math.max(ans, boxes[i][2] + maxHeightRecur(j, boxes));
}
}
return ans;
}
static int maxHeight(int[] height, int[] width, int[] length) {
int n = height.length;
// Create a 2d array to store all
// orientations of boxes in (l, b, h)
// manner.
int[][] boxes = new int[n * 6][3];
int index = 0;
for (int i = 0; i < n; i++) {
int a = height[i], b = width[i], c = length[i];
boxes[index++] = new int[]{a, b, c};
boxes[index++] = new int[]{a, c, b};
boxes[index++] = new int[]{b, a, c};
boxes[index++] = new int[]{b, c, a};
boxes[index++] = new int[]{c, a, b};
boxes[index++] = new int[]{c, b, a};
}
// Sort the boxes in descending
// order of length and width.
Arrays.sort(boxes, (box1, box2) -> {
if (box1[0] == box2[0]) {
return Integer.compare(box1[1], box2[1]);
}
return Integer.compare(box2[0], box1[0]);
});
int ans = 0;
// Check for all boxes starting as base.
for (int i = 0; i < boxes.length; i++) {
ans = Math.max(ans, maxHeightRecur(i, boxes));
}
return ans;
}
public static void main(String[] args) {
int[] height = {4, 1, 4, 10};
int[] width = {6, 2, 5, 12};
int[] length = {7, 3, 6, 32};
System.out.println(maxHeight(height, width, length));
}
}
# Python program to implement
# box stacking problem
# function to find the maximum height
# with box i as base.
def maxHeightRecur(i, boxes):
ans = boxes[i][2]
# Check all the next boxes
for j in range(i + 1, len(boxes)):
# If size of box j is less than
# size of box i.
if boxes[i][0] > boxes[j][0] and boxes[i][1] > boxes[j][1]:
ans = max(ans, boxes[i][2] + maxHeightRecur(j, boxes))
return ans
def maxHeight(height, width, length):
n = len(height)
# Create a 2d array to store all
# orientations of boxes in (l, b, h)
# manner.
boxes = []
for i in range(n):
a, b, c = height[i], width[i], length[i]
boxes.append([a, b, c])
boxes.append([a, c, b])
boxes.append([b, a, c])
boxes.append([b, c, a])
boxes.append([c, a, b])
boxes.append([c, b, a])
# Sort the boxes in descending
# order of length and width.
boxes.sort(key=lambda x: (x[0], x[1]), reverse=True)
ans = 0
# Check for all boxes starting as base.
for i in range(len(boxes)):
ans = max(ans, maxHeightRecur(i, boxes))
return ans
if __name__ == "__main__":
height = [4, 1, 4, 10]
width = [6, 2, 5, 12]
length = [7, 3, 6, 32]
print(maxHeight(height, width, length))
// C# program to implement
// box stacking problem
using System;
using System.Collections.Generic;
class GfG {
// Function to find the maximum height
// with box i as base.
static int maxHeightRecur(int i, List<List<int>> boxes) {
int ans = boxes[i][2];
// Check all the next boxes
for (int j = i + 1; j < boxes.Count; j++) {
// If size of box j is less than
// size of box i.
if (boxes[i][0] > boxes[j][0] &&
boxes[i][1] > boxes[j][1]) {
ans = Math.Max(ans, boxes[i][2] +
maxHeightRecur(j, boxes));
}
}
return ans;
}
static int maxHeight(int[] height, int[] width, int[] length) {
int n = height.Length;
// Create a 2d array to store all
// orientations of boxes in (l, b, h)
// manner.
List<List<int>> boxes = new List<List<int>>();
for (int i = 0; i < n; i++) {
int a = height[i], b = width[i], c = length[i];
boxes.Add(new List<int> { a, b, c });
boxes.Add(new List<int> { a, c, b });
boxes.Add(new List<int> { b, a, c });
boxes.Add(new List<int> { b, c, a });
boxes.Add(new List<int> { c, a, b });
boxes.Add(new List<int> { c, b, a });
}
// Sort the boxes in descending
// order of length and width.
boxes.Sort((x, y) => y[0] != x[0] ?
y[0].CompareTo(x[0]) : y[1].CompareTo(x[1]));
int ans = 0;
// Check for all boxes starting as base.
for (int i = 0; i < boxes.Count; i++) {
ans = Math.Max(ans, maxHeightRecur(i, boxes));
}
return ans;
}
static void Main() {
int[] height = { 4, 1, 4, 10 };
int[] width = { 6, 2, 5, 12 };
int[] length = { 7, 3, 6, 32 };
Console.WriteLine(maxHeight(height, width, length));
}
}
// JavaScript program to implement
// box stacking problem
// Function to find the maximum height
// with box i as base.
function maxHeightRecur(i, boxes) {
let ans = boxes[i][2];
// Check all the next boxes
for (let j = i + 1; j < boxes.length; j++) {
// If size of box j is less than
// size of box i.
if (boxes[i][0] > boxes[j][0] && boxes[i][1] > boxes[j][1]) {
ans = Math.max(ans, boxes[i][2] + maxHeightRecur(j, boxes));
}
}
return ans;
}
function maxHeight(height, width, length) {
let n = height.length;
// Create a 2d array to store all
// orientations of boxes in (l, b, h)
// manner.
let boxes = [];
for (let i = 0; i < n; i++) {
let a = height[i], b = width[i], c = length[i];
boxes.push([a, b, c]);
boxes.push([a, c, b]);
boxes.push([b, a, c]);
boxes.push([b, c, a]);
boxes.push([c, a, b]);
boxes.push([c, b, a]);
}
// Sort the boxes in descending
// order of length and width.
boxes.sort((x, y) => y[0] !== x[0] ? y[0] - x[0] : y[1] - x[1]);
let ans = 0;
// Check for all boxes starting as base.
for (let i = 0; i < boxes.length; i++) {
ans = Math.max(ans, maxHeightRecur(i, boxes));
}
return ans;
}
let height = [4, 1, 4, 10];
let width = [6, 2, 5, 12];
let length = [7, 3, 6, 32];
console.log(maxHeight(height, width, length));
Using Top-Down DP (Memoization) - O(n^2) Time and O(n) Space
If we notice carefully, we can observe that the above recursive solution holds the following two properties of Dynamic Programming:
1. Optimal Substructure: Maximum height of box stack at index i, i.e., maxHeight(i), depends on the optimal solutions of the subproblems maxHeight(j) for all j > i and base of j is smaller than i. By comparing these optimal substructures, we can efficiently calculate the maximum height of box stack at index i.
2. Overlapping Subproblems: While applying a recursive approach in this problem, we notice that certain subproblems are computed multiple times.
- There is only one parameter: i that changes in the recursive solution. So we create a 1D array of size 6*n for memorization (since there are 6 possible orientations for each box). Therefore, memo[i] stores the result for the i-th box in the sorted list of orientations.
- We initialize this array as -1 to indicate nothing is computed initially.
- Now we modify our recursive solution to first check if the value is -1, then only make recursive calls. This way, we avoid re-computations of the same subproblems.
C++
// C++ program to implement
// box stacking problem
#include <bits/stdc++.h>
using namespace std;
// Function to find the maximum height
// with box i as base.
int maxHeightRecur(int i, vector<vector<int>> &boxes,
vector<int> &memo) {
// If value is memoized
if (memo[i] != -1) return memo[i];
int ans = boxes[i][2];
// Check all the next boxes
for (int j=i+1; j<boxes.size(); j++) {
// If size of box j is less than
// size of box i.
if (boxes[i][0]>boxes[j][0] && boxes[i][1]>boxes[j][1]){
ans = max(ans, boxes[i][2] + maxHeightRecur(j, boxes, memo));
}
}
return memo[i] = ans;
}
int maxHeight(vector<int> &height, vector<int> &width, vector<int> &length) {
int n = height.size();
// Create a 2d array to store all
// orientations of boxes in (l, b, h)
// manner.
vector<vector<int>> boxes;
for (int i=0; i<n; i++) {
int a = height[i], b = width[i],
c = length[i];
boxes.push_back({a, b, c});
boxes.push_back({a, c, b});
boxes.push_back({b, a, c});
boxes.push_back({b, c, a});
boxes.push_back({c, a, b});
boxes.push_back({c, b, a});
}
// Sort the boxes in descending
// order of length and width.
sort(boxes.begin(), boxes.end(), greater<vector<int>>());
vector<int> memo(boxes.size(), -1);
int ans = 0;
// Check for all boxes starting as base.
for (int i=0; i<boxes.size(); i++) {
ans = max(ans, maxHeightRecur(i, boxes, memo));
}
return ans;
}
int main() {
vector<int> height = {4,1,4,10};
vector<int> width = {6,2,5,12};
vector<int> length = {7,3,6,32};
cout << maxHeight(height, width, length);
return 0;
}
// Java program to implement
// box stacking problem
import java.util.*;
class GfG {
// Function to find the maximum height
// with box i as base.
static int maxHeightRecur(int i, int[][] boxes, int[] memo) {
// If value is memoized
if (memo[i] != -1) return memo[i];
int ans = boxes[i][2];
// Check all the next boxes
for (int j = i + 1; j < boxes.length; j++) {
// If size of box j is less than
// size of box i.
if (boxes[i][0] > boxes[j][0] && boxes[i][1] > boxes[j][1]) {
ans = Math.max(ans, boxes[i][2] + maxHeightRecur(j, boxes, memo));
}
}
return memo[i] = ans;
}
static int maxHeight(int[] height, int[] width, int[] length) {
int n = height.length;
// Create a 2d array to store all
// orientations of boxes in (l, b, h)
// manner.
List<int[]> boxes = new ArrayList<>();
for (int i = 0; i < n; i++) {
int a = height[i], b = width[i], c = length[i];
boxes.add(new int[] {a, b, c});
boxes.add(new int[] {a, c, b});
boxes.add(new int[] {b, a, c});
boxes.add(new int[] {b, c, a});
boxes.add(new int[] {c, a, b});
boxes.add(new int[] {c, b, a});
}
// Sort the boxes in descending
// order of length and width.
boxes.sort((x, y) -> y[0] != x[0] ? y[0] - x[0] : y[1] - x[1]);
int[] memo = new int[boxes.size()];
Arrays.fill(memo, -1);
int ans = 0;
// Check for all boxes starting as base.
for (int i = 0; i < boxes.size(); i++) {
ans = Math.max(ans, maxHeightRecur(i, boxes.toArray(new int[0][]), memo));
}
return ans;
}
public static void main(String[] args) {
int[] height = {4, 1, 4, 10};
int[] width = {6, 2, 5, 12};
int[] length = {7, 3, 6, 32};
System.out.println(maxHeight(height, width, length));
}
}
# Python program to implement
# box stacking problem
def maxHeightRecur(i, boxes, memo):
# If value is memoized
if memo[i] != -1:
return memo[i]
ans = boxes[i][2]
# Check all the next boxes
for j in range(i + 1, len(boxes)):
# If size of box j is less than
# size of box i.
if boxes[i][0] > boxes[j][0] and boxes[i][1] > boxes[j][1]:
ans = max(ans, boxes[i][2] + maxHeightRecur(j, boxes, memo))
memo[i] = ans
return ans
def maxHeight(height, width, length):
n = len(height)
# Create a 2d array to store all
# orientations of boxes in (l, b, h)
# manner.
boxes = []
for i in range(n):
a, b, c = height[i], width[i], length[i]
boxes.append([a, b, c])
boxes.append([a, c, b])
boxes.append([b, a, c])
boxes.append([b, c, a])
boxes.append([c, a, b])
boxes.append([c, b, a])
# Sort the boxes in descending
# order of length and width.
boxes.sort(key=lambda x: (x[0], x[1]), reverse=True)
memo = [-1] * len(boxes)
ans = 0
# Check for all boxes starting as base.
for i in range(len(boxes)):
ans = max(ans, maxHeightRecur(i, boxes, memo))
return ans
if __name__ == "__main__":
height = [4, 1, 4, 10]
width = [6, 2, 5, 12]
length = [7, 3, 6, 32]
print(maxHeight(height, width, length))
// C# program to implement
// box stacking problem
using System;
using System.Collections.Generic;
class GfG {
// Function to find the maximum height
// with box i as base.
static int maxHeightRecur(int i, List<List<int>> boxes,
int[] memo) {
// If value is memoized
if (memo[i] != -1) return memo[i];
int ans = boxes[i][2];
// Check all the next boxes
for (int j = i + 1; j < boxes.Count; j++) {
// If size of box j is less than
// size of box i.
if (boxes[i][0] > boxes[j][0] && boxes[i][1] > boxes[j][1]) {
ans = Math.Max(ans, boxes[i][2] + maxHeightRecur(j, boxes, memo));
}
}
return memo[i] = ans;
}
static int maxHeight(int[] height, int[] width, int[] length) {
int n = height.Length;
// Create a 2d array to store all
// orientations of boxes in (l, b, h)
// manner.
List<List<int>> boxes = new List<List<int>>();
for (int i = 0; i < n; i++) {
int a = height[i], b = width[i], c = length[i];
boxes.Add(new List<int> { a, b, c });
boxes.Add(new List<int> { a, c, b });
boxes.Add(new List<int> { b, a, c });
boxes.Add(new List<int> { b, c, a });
boxes.Add(new List<int> { c, a, b });
boxes.Add(new List<int> { c, b, a });
}
// Sort the boxes in descending
// order of length and width.
boxes.Sort((x, y) => y[0] != x[0] ? y[0].CompareTo(x[0]) : y[1].CompareTo(x[1]));
int[] memo = new int[boxes.Count];
Array.Fill(memo, -1);
int ans = 0;
// Check for all boxes starting as base.
for (int i = 0; i < boxes.Count; i++) {
ans = Math.Max(ans, maxHeightRecur(i, boxes, memo));
}
return ans;
}
static void Main() {
int[] height = { 4, 1, 4, 10 };
int[] width = { 6, 2, 5, 12 };
int[] length = { 7, 3, 6, 32 };
Console.WriteLine(maxHeight(height, width, length));
}
}
// JavaScript program to implement
// box stacking problem
// Function to find the maximum height
// with box i as base.
function maxHeightRecur(i, boxes, memo) {
// If value is memoized
if (memo[i] !== -1) return memo[i];
let ans = boxes[i][2];
// Check all the next boxes
for (let j = i + 1; j < boxes.length; j++) {
// If size of box j is less than
// size of box i.
if (boxes[i][0] > boxes[j][0] && boxes[i][1] > boxes[j][1]) {
ans = Math.max(ans, boxes[i][2] + maxHeightRecur(j, boxes, memo));
}
}
memo[i] = ans;
return ans;
}
function maxHeight(height, width, length) {
let n = height.length;
// Create a 2d array to store all
// orientations of boxes in (l, b, h)
// manner.
let boxes = [];
for (let i = 0; i < n; i++) {
let a = height[i], b = width[i], c = length[i];
boxes.push([a, b, c]);
boxes.push([a, c, b]);
boxes.push([b, a, c]);
boxes.push([b, c, a]);
boxes.push([c, a, b]);
boxes.push([c, b, a]);
}
// Sort the boxes in descending
// order of length and width.
boxes.sort((x, y) => y[0] !== x[0] ? y[0] - x[0] : y[1] - x[1]);
let memo = new Array(boxes.length).fill(-1);
let ans = 0;
// Check for all boxes starting as base.
for (let i = 0; i < boxes.length; i++) {
ans = Math.max(ans, maxHeightRecur(i, boxes, memo));
}
return ans;
}
let height = [4, 1, 4, 10];
let width = [6, 2, 5, 12];
let length = [7, 3, 6, 32];
console.log(maxHeight(height, width, length));
Using Bottom-Up DP (Tabulation) - O(n^2) Time and O(n) Space
The idea is to fill the DP table from bottom to up. The table is filled in an iterative manner from i = n-1 to i = 0. For each box i, The dynamic programming relation is as follows:
- set dp[i] = height[i]
- For j > i and base of j is smaller than base of i, set dp[i] = max(dp[i], height[i] + dp[j]).
C++
// C++ program to implement
// box stacking problem
#include <bits/stdc++.h>
using namespace std;
int maxHeight(vector<int> &height, vector<int> &width, vector<int> &length) {
int n = height.size();
// Create a 2d array to store all
// orientations of boxes in (l, b, h)
// manner.
vector<vector<int>> boxes;
for (int i = 0; i < n; i++) {
int a = height[i], b = width[i], c = length[i];
boxes.push_back({a, b, c});
boxes.push_back({a, c, b});
boxes.push_back({b, a, c});
boxes.push_back({b, c, a});
boxes.push_back({c, a, b});
boxes.push_back({c, b, a});
}
// Sort the boxes in descending
// order of length and width.
sort(boxes.begin(), boxes.end(), greater<vector<int>>());
vector<int> dp(boxes.size());
int ans = 0;
// Check for all boxes starting as base.
for (int i = boxes.size() - 1; i >= 0; i--) {
dp[i] = boxes[i][2];
for (int j = i + 1; j < boxes.size(); j++) {
if (boxes[i][0] > boxes[j][0] && boxes[i][1] > boxes[j][1]) {
dp[i] = max(dp[i], boxes[i][2] + dp[j]);
}
}
ans = max(ans, dp[i]);
}
return ans;
}
int main() {
vector<int> height = {4, 1, 4, 10};
vector<int> width = {6, 2, 5, 12};
vector<int> length = {7, 3, 6, 32};
cout << maxHeight(height, width, length);
return 0;
}
// Java program to implement
// box stacking problem
import java.util.*;
class GfG {
// Function to find the maximum height
// with box i as base.
static int maxHeight(int[] height, int[] width, int[] length) {
int n = height.length;
// Create a 2d array to store all
// orientations of boxes in (l, b, h)
// manner.
List<int[]> boxes = new ArrayList<>();
for (int i = 0; i < n; i++) {
int a = height[i], b = width[i], c = length[i];
boxes.add(new int[] {a, b, c});
boxes.add(new int[] {a, c, b});
boxes.add(new int[] {b, a, c});
boxes.add(new int[] {b, c, a});
boxes.add(new int[] {c, a, b});
boxes.add(new int[] {c, b, a});
}
// Sort the boxes in descending
// order of length and width.
boxes.sort((x, y) -> y[0] != x[0] ? y[0] - x[0] : y[1] - x[1]);
int[] dp = new int[boxes.size()];
int ans = 0;
// Check for all boxes starting as base.
for (int i = boxes.size() - 1; i >= 0; i--) {
dp[i] = boxes.get(i)[2];
for (int j = i + 1; j < boxes.size(); j++) {
if (boxes.get(i)[0] > boxes.get(j)[0] &&
boxes.get(i)[1] > boxes.get(j)[1]) {
dp[i] = Math.max(dp[i], boxes.get(i)[2] + dp[j]);
}
}
ans = Math.max(ans, dp[i]);
}
return ans;
}
public static void main(String[] args) {
int[] height = {4, 1, 4, 10};
int[] width = {6, 2, 5, 12};
int[] length = {7, 3, 6, 32};
System.out.println(maxHeight(height, width, length));
}
}
# Python program to implement
# box stacking problem
def maxHeight(height, width, length):
n = len(height)
# Create a 2d array to store all
# orientations of boxes in (l, b, h)
# manner.
boxes = []
for i in range(n):
a, b, c = height[i], width[i], length[i]
boxes.append([a, b, c])
boxes.append([a, c, b])
boxes.append([b, a, c])
boxes.append([b, c, a])
boxes.append([c, a, b])
boxes.append([c, b, a])
# Sort the boxes in descending
# order of length and width.
boxes.sort(key=lambda x: (x[0], x[1]), reverse=True)
dp = [0] * len(boxes)
ans = 0
# Check for all boxes starting as base.
for i in range(len(boxes) - 1, -1, -1):
dp[i] = boxes[i][2]
for j in range(i + 1, len(boxes)):
if boxes[i][0] > boxes[j][0] and boxes[i][1] > boxes[j][1]:
dp[i] = max(dp[i], boxes[i][2] + dp[j])
ans = max(ans, dp[i])
return ans
if __name__ == "__main__":
height = [4, 1, 4, 10]
width = [6, 2, 5, 12]
length = [7, 3, 6, 32]
print(maxHeight(height, width, length))
// C# program to implement
// box stacking problem
using System;
using System.Collections.Generic;
class GfG {
// Function to find the maximum height
// with box i as base.
static int maxHeight(int[] height, int[] width, int[] length) {
int n = height.Length;
// Create a 2d array to store all
// orientations of boxes in (l, b, h)
// manner.
List<int[]> boxes = new List<int[]>();
for (int i = 0; i < n; i++) {
int a = height[i], b = width[i], c = length[i];
boxes.Add(new int[] {a, b, c});
boxes.Add(new int[] {a, c, b});
boxes.Add(new int[] {b, a, c});
boxes.Add(new int[] {b, c, a});
boxes.Add(new int[] {c, a, b});
boxes.Add(new int[] {c, b, a});
}
// Sort the boxes in descending
// order of length and width.
boxes.Sort((x, y) => y[0] != x[0] ? y[0].CompareTo(x[0]) : y[1].CompareTo(x[1]));
int[] dp = new int[boxes.Count];
int ans = 0;
// Check for all boxes starting as base.
for (int i = boxes.Count - 1; i >= 0; i--) {
dp[i] = boxes[i][2];
for (int j = i + 1; j < boxes.Count; j++) {
if (boxes[i][0] > boxes[j][0] && boxes[i][1] > boxes[j][1]) {
dp[i] = Math.Max(dp[i], boxes[i][2] + dp[j]);
}
}
ans = Math.Max(ans, dp[i]);
}
return ans;
}
static void Main() {
int[] height = { 4, 1, 4, 10 };
int[] width = { 6, 2, 5, 12 };
int[] length = { 7, 3, 6, 32 };
Console.WriteLine(maxHeight(height, width, length));
}
}
// JavaScript program to implement
// box stacking problem
// Function to find the maximum height
// with box i as base.
function maxHeight(height, width, length) {
let n = height.length;
// Create a 2d array to store all
// orientations of boxes in (l, b, h)
// manner.
let boxes = [];
for (let i = 0; i < n; i++) {
let a = height[i], b = width[i], c = length[i];
boxes.push([a, b, c]);
boxes.push([a, c, b]);
boxes.push([b, a, c]);
boxes.push([b, c, a]);
boxes.push([c, a, b]);
boxes.push([c, b, a]);
}
// Sort the boxes in descending
// order of length and width.
boxes.sort((x, y) => y[0] !== x[0] ? y[0] - x[0] : y[1] - x[1]);
let dp = new Array(boxes.length).fill(0);
let ans = 0;
// Check for all boxes starting as base.
for (let i = boxes.length - 1; i >= 0; i--) {
dp[i] = boxes[i][2];
for (let j = i + 1; j < boxes.length; j++) {
if (boxes[i][0] > boxes[j][0] && boxes[i][1] > boxes[j][1]) {
dp[i] = Math.max(dp[i], boxes[i][2] + dp[j]);
}
}
ans = Math.max(ans, dp[i]);
}
return ans;
}
let height = [4, 1, 4, 10];
let width = [6, 2, 5, 12];
let length = [7, 3, 6, 32];
console.log(maxHeight(height, width, length));
Similar Reads
Dynamic Programming or DP
Dynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
What is Memoization? A Complete Tutorial
In this tutorial, we will dive into memoization, a powerful optimization technique that can drastically improve the performance of certain algorithms. Memoization helps by storing the results of expensive function calls and reusing them when the same inputs occur again. This avoids redundant calcula
6 min read
Dynamic Programming (DP) Introduction
Dynamic Programming is a commonly used algorithmic technique used to optimize recursive solutions when same subproblems are called again.The core idea behind DP is to store solutions to subproblems so that each is solved only once. To solve DP problems, we first write a recursive solution in a way t
15+ min read
Tabulation vs Memoization
Tabulation and memoization are two techniques used to implement dynamic programming. Both techniques are used when there are overlapping subproblems (the same subproblem is executed multiple times). Below is an overview of two approaches.Memoization:Top-down approachStores the results of function ca
9 min read
Optimal Substructure Property in Dynamic Programming | DP-2
The following are the two main properties of a problem that suggest that the given problem can be solved using Dynamic programming: 1) Overlapping Subproblems 2) Optimal Substructure We have already discussed the Overlapping Subproblem property. Let us discuss the Optimal Substructure property here.
3 min read
Overlapping Subproblems Property in Dynamic Programming | DP-1
Dynamic Programming is an algorithmic paradigm that solves a given complex problem by breaking it into subproblems using recursion and storing the results of subproblems to avoid computing the same results again. Following are the two main properties of a problem that suggests that the given problem
10 min read
Steps to solve a Dynamic Programming Problem
Steps to solve a Dynamic programming problem:Identify if it is a Dynamic programming problem.Decide a state expression with the Least parameters.Formulate state and transition relationship.Apply tabulation or memorization.Step 1: How to classify a problem as a Dynamic Programming Problem? Typically,
13 min read
Advanced Topics
Count Ways To Assign Unique Cap To Every Person
Given n people and 100 types of caps labelled from 1 to 100, along with a 2D integer array caps where caps[i] represents the list of caps preferred by the i-th person, the task is to determine the number of ways the n people can wear different caps.Example:Input: caps = [[3, 4], [4, 5], [5]] Output:
15+ min read
Digit DP | Introduction
Prerequisite : How to solve a Dynamic Programming Problem ?There are many types of problems that ask to count the number of integers 'x' between two integers say 'a' and 'b' such that x satisfies a specific property that can be related to its digits.So, if we say G(x) tells the number of such intege
14 min read
Sum over Subsets | Dynamic Programming
Prerequisite: Basic Dynamic Programming, Bitmasks Consider the following problem where we will use Sum over subset Dynamic Programming to solve it. Given an array of 2n integers, we need to calculate function F(x) = ?Ai such that x&i==i for all x. i.e, i is a bitwise subset of x. i will be a bit
10 min read
Easy problems in Dynamic programming
Coin Change - Count Ways to Make Sum
Given an integer array of coins[] of size n representing different types of denominations and an integer sum, the task is to count all combinations of coins to make a given value sum. Note: Assume that you have an infinite supply of each type of coin. Examples: Input: sum = 4, coins[] = [1, 2, 3]Out
15+ min read
Subset Sum Problem
Given an array arr[] of non-negative integers and a value sum, the task is to check if there is a subset of the given array whose sum is equal to the given sum. Examples: Input: arr[] = [3, 34, 4, 12, 5, 2], sum = 9Output: TrueExplanation: There is a subset (4, 5) with sum 9.Input: arr[] = [3, 34, 4
15+ min read
Introduction and Dynamic Programming solution to compute nCr%p
Given three numbers n, r and p, compute value of nCr mod p. Example: Input: n = 10, r = 2, p = 13 Output: 6 Explanation: 10C2 is 45 and 45 % 13 is 6.We strongly recommend that you click here and practice it, before moving on to the solution.METHOD 1: (Using Dynamic Programming) A Simple Solution is
15+ min read
Rod Cutting
Given a rod of length n inches and an array price[]. price[i] denotes the value of a piece of length i. The task is to determine the maximum value obtainable by cutting up the rod and selling the pieces.Note: price[] is 1-indexed array.Input: price[] = [1, 5, 8, 9, 10, 17, 17, 20]Output: 22Explanati
15+ min read
Painting Fence Algorithm
Given a fence with n posts and k colors, the task is to find out the number of ways of painting the fence so that not more than two consecutive posts have the same color.Examples:Input: n = 2, k = 4Output: 16Explanation: We have 4 colors and 2 posts.Ways when both posts have same color: 4 Ways when
15 min read
Longest Common Subsequence (LCS)
Given two strings, s1 and s2, the task is to find the length of the Longest Common Subsequence. If there is no common subsequence, return 0. A subsequence is a string generated from the original string by deleting 0 or more characters, without changing the relative order of the remaining characters.
15+ min read
Longest Increasing Subsequence (LIS)
Given an array arr[] of size n, the task is to find the length of the Longest Increasing Subsequence (LIS) i.e., the longest possible subsequence in which the elements of the subsequence are sorted in increasing order.Examples: Input: arr[] = [3, 10, 2, 1, 20]Output: 3Explanation: The longest increa
14 min read
Longest subsequence such that difference between adjacents is one
Given an array arr[] of size n, the task is to find the longest subsequence such that the absolute difference between adjacent elements is 1.Examples: Input: arr[] = [10, 9, 4, 5, 4, 8, 6]Output: 3Explanation: The three possible subsequences of length 3 are [10, 9, 8], [4, 5, 4], and [4, 5, 6], wher
15+ min read
Maximum size square sub-matrix with all 1s
Given a binary matrix mat of size n * m, the task is to find out the maximum length of a side of a square sub-matrix with all 1s.Example:Input: mat = [ [0, 1, 1, 0, 1], [1, 1, 0, 1, 0], [0, 1, 1, 1, 0], [1, 1, 1, 1, 0], [1, 1, 1, 1, 1], [0, 0, 0, 0, 0] ]Output: 3Explanation: The maximum length of a
15+ min read
Min Cost Path
You are given a 2D matrix cost[][] of dimensions m × n, where each cell represents the cost of traversing through that position. Your goal is to determine the minimum cost required to reach the bottom-right cell (m-1, n-1) starting from the top-left cell (0,0).The total cost of a path is the sum of
15+ min read
Longest Common Substring (Space optimized DP solution)
Given two strings ‘s1‘ and ‘s2‘, find the length of the longest common substring. Example: Input: s1 = “GeeksforGeeksâ€, s2 = “GeeksQuiz†Output : 5 Explanation:The longest common substring is “Geeks†and is of length 5.Input: s1 = “abcdxyzâ€, s2 = “xyzabcd†Output : 4Explanation:The longest common su
7 min read
Count ways to reach the nth stair using step 1, 2 or 3
A child is running up a staircase with n steps and can hop either 1 step, 2 steps, or 3 steps at a time. The task is to implement a method to count how many possible ways the child can run up the stairs.Examples: Input: 4Output: 7Explanation: There are seven ways: {1, 1, 1, 1}, {1, 2, 1}, {2, 1, 1},
15+ min read
Grid Unique Paths - Count Paths in matrix
Given an matrix of size m x n, the task is to find the count of all unique possible paths from top left to the bottom right with the constraints that from each cell we can either move only to the right or down.Examples: Input: m = 2, n = 2Output: 2Explanation: There are two paths(0, 0) -> (0, 1)
15+ min read
Unique paths in a Grid with Obstacles
Given a matrix mat[][] of size n * m, where mat[i][j] = 1 indicates an obstacle and mat[i][j] = 0 indicates an empty space. The task is to find the number of unique paths to reach (n-1, m-1) starting from (0, 0). You are allowed to move in the right or downward direction. Note: In the grid, cells ma
15+ min read
Medium problems on Dynamic programming
0/1 Knapsack Problem
Given n items where each item has some weight and profit associated with it and also given a bag with capacity W, [i.e., the bag can hold at most W weight in it]. The task is to put the items into the bag such that the sum of profits associated with them is the maximum possible. Note: The constraint
15+ min read
Printing Items in 0/1 Knapsack
Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack. In other words, given two integer arrays, val[0..n-1] and wt[0..n-1] represent values and weights associated with n items respectively. Also given an integer W which repre
12 min read
Unbounded Knapsack (Repetition of items allowed)
Given a knapsack weight, say capacity and a set of n items with certain value vali and weight wti, The task is to fill the knapsack in such a way that we can get the maximum profit. This is different from the classical Knapsack problem, here we are allowed to use an unlimited number of instances of
15+ min read
Egg Dropping Puzzle | DP-11
You are given n identical eggs and you have access to a k-floored building from 1 to k.There exists a floor f where 0 <= f <= k such that any egg dropped from a floor higher than f will break, and any egg dropped from or below floor f will not break. There are a few rules given below:An egg th
15+ min read
Word Break
Given a string s and y a dictionary of n words dictionary, check if s can be segmented into a sequence of valid words from the dictionary, separated by spaces.Examples:Input: s = "ilike", dictionary[] = ["i", "like", "gfg"]Output: trueExplanation: The string can be segmented as "i like".Input: s = "
12 min read
Vertex Cover Problem (Dynamic Programming Solution for Tree)
A vertex cover of an undirected graph is a subset of its vertices such that for every edge (u, v) of the graph, either ‘u’ or ‘v’ is in vertex cover. Although the name is Vertex Cover, the set covers all edges of the given graph. The problem to find minimum size vertex cover of a graph is NP complet
15+ min read
Tile Stacking Problem
Given integers n (the height of the tower), m (the maximum size of tiles available), and k (the maximum number of times each tile size can be used), the task is to calculate the number of distinct stable towers of height n that can be built. Note:A stable tower consists of exactly n tiles, each stac
15+ min read
Box Stacking Problem
Given three arrays height[], width[], and length[] of size n, where height[i], width[i], and length[i] represent the dimensions of a box. The task is to create a stack of boxes that is as tall as possible, but we can only stack a box on top of another box if the dimensions of the 2-D base of the low
15+ min read
Partition a Set into Two Subsets of Equal Sum
Given an array arr[], the task is to check if it can be partitioned into two parts such that the sum of elements in both parts is the same.Note: Each element is present in either the first subset or the second subset, but not in both.Examples: Input: arr[] = [1, 5, 11, 5]Output: true Explanation: Th
15+ min read
Travelling Salesman Problem using Dynamic Programming
Given a 2d matrix cost[][] of size n where cost[i][j] denotes the cost of moving from city i to city j. The task is to complete a tour from city 0 (0-based index) to all other cities such that we visit each city exactly once and then at the end come back to city 0 at minimum cost.Note the difference
15 min read
Longest Palindromic Subsequence (LPS)
Given a string s, find the length of the Longest Palindromic Subsequence in it. Note: The Longest Palindromic Subsequence (LPS) is the maximum-length subsequence of a given string that is also a Palindrome. Longest Palindromic SubsequenceExamples:Input: s = "bbabcbcab"Output: 7Explanation: Subsequen
15+ min read
Longest Common Increasing Subsequence (LCS + LIS)
Given two arrays, a[] and b[], find the length of the longest common increasing subsequence(LCIS). LCIS refers to a subsequence that is present in both arrays and strictly increases.Prerequisites: LCS, LIS.Examples:Input: a[] = [3, 4, 9, 1], b[] = [5, 3, 8, 9, 10, 2, 1]Output: 2Explanation: The long
15+ min read
Find all distinct subset (or subsequence) sums of an array
Given an array arr[] of size n, the task is to find a distinct sum that can be generated from the subsets of the given sets and return them in increasing order. It is given that the sum of array elements is small.Examples: Input: arr[] = [1, 2]Output: [0, 1, 2, 3]Explanation: Four distinct sums can
15+ min read
Weighted Job Scheduling
Given a 2D array jobs[][] of order n*3, where each element jobs[i] defines start time, end time, and the profit associated with the job. The task is to find the maximum profit you can take such that there are no two jobs with overlapping time ranges.Note: If the job ends at time X, it is allowed to
15+ min read
Count Derangements (Permutation such that no element appears in its original position)
A Derangement is a permutation of n elements, such that no element appears in its original position. For example, a derangement of [0, 1, 2, 3] is [2, 3, 1, 0].Given a number n, find the total number of Derangements of a set of n elements.Examples : Input: n = 2Output: 1Explanation: For two balls [1
12 min read
Minimum insertions to form a palindrome
Given a string s, the task is to find the minimum number of characters to be inserted to convert it to a palindrome.Examples:Input: s = "geeks"Output: 3Explanation: "skgeegks" is a palindromic string, which requires 3 insertions.Input: s= "abcd"Output: 3Explanation: "abcdcba" is a palindromic string
15+ min read
Ways to arrange Balls such that adjacent balls are of different types
There are 'p' balls of type P, 'q' balls of type Q and 'r' balls of type R. Using the balls we want to create a straight line such that no two balls of the same type are adjacent.Examples : Input: p = 1, q = 1, r = 0Output: 2Explanation: There are only two arrangements PQ and QPInput: p = 1, q = 1,
15+ min read