Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C++

Solution: Dungeon Game

Understand how to apply dynamic programming techniques to solve the dungeon game challenge. Learn to compute the minimum initial health needed for the knight to survive while moving through a health-affecting grid, using a bottom-up DP approach that ensures survival until the princess is rescued.

We'll cover the following...

Statement

A group of demons has captured a princess and locked her in the bottom-right corner of a dungeon. The dungeon is represented as a 2D grid of size m×nm × n, where each cell contains an integer value that affects the knight’s health.

The knight, starting in the top-left corner of the grid, must travel through the dungeon to rescue the princess.
He can move only to the right or downward at each step.

  • If a cell ...