Problem Session 8

TL;DR

Use dynamic programming to find the maximum height of a stack of blocks, with strict support conditions and the ability to rotate the blocks.

Transcript

[SQUEAKING] [RUSTLING] [CLICKING] JUSTIN SOLOMON: Right, so today is going to be our first, I believe, of two problem sessions covering dynamic programming. I've learned dynamic programming is one of these interesting parts of an algorithms class where, somehow, the people that are really good at it are completely disjoint with the people that are ... Read More

Key Insights

• 🚫 The blocks can be rotated, but strict support conditions must be met.
• 🚫 Saggy wants to maximize the height while keeping the blocks stable.

Questions & Answers

Q: How does Saggy stack the blocks?

Saggy can stack the blocks in any order, as long as the strict support conditions are met.

Q: What are the criteria for a valid block stacking?

Each block must be strictly supported on the block below it, and Saggy can rotate the blocks.

Q: What is the goal of the problem?

The goal is to find the maximum height of the stack of blocks.

Summary & Key Takeaways

• Saggy Mimsin wants to stack blocks on top of each other with strict support conditions.

• Each block has a width, height, and length, and she can rotate them.

• The goal is to find the maximum height of the stack using dynamic programming.