Compute maze score using shortest path

Q: Compute maze score using shortest path

This question evaluates competency in grid-based pathfinding, graph modeling, and algorithmic complexity analysis for computing shortest paths in discrete spaces.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

You are given a grid-based maze game.

The maze is an R x C grid of characters:
- '#' = wall (cannot pass)
- '.' = empty cell
- 'S' = current player position (exactly one)
- 'E' = exit/goal (exactly one)
The game “score” for a state is defined as the length of the shortest path (minimum number of moves) from S to E , moving 4-directionally (up/down/left/right) and not passing through walls.
If E is unreachable, return -1 .

Write a function that takes the maze grid and returns the score.

Clarify in your solution:

Time and space complexity
How you would adapt it if the game state were provided separately as (startRow, startCol) instead of embedding 'S' in the grid.

Compute maze score using shortest path

Quick Overview

Comments (0)