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

Solution: Dungeon Game

Explore a dynamic programming approach to determine the minimum initial health a knight needs to survive a dungeon represented as a 2D grid. Understand how to calculate the health points required at each step while moving only right or down, ensuring the knight's health never falls to zero or below on the journey to rescue the princess.

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