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

Solution: Dungeon Game

Explore how to apply dynamic programming to solve the Dungeon Game problem, where you determine the minimum health required for a knight to survive a journey through a grid filled with health-altering cells. Understand how working backward from the destination helps calculate the optimal path and health needs efficiently.

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 ...