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

Solution: Dungeon Game

Explore the dynamic programming technique to solve the Dungeon Game challenge, calculating the minimum health a knight needs to start his journey safely. Understand backward computation from the princess's position to the knight's start, ensuring survival through health-impacting cells within a 2D dungeon grid.

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