## Round 1 - Coding ## Problem A character wants to reach a snack at the far corner of a grid without being seen. Each cell has a detection cost (0 means safe, higher means riskier). Find the path from top-left `(0,0)` to bottom-right `(M-1,N-1)` that minimizes total detection cost. You can only move right or down. ```python def min_detection_cost(grid: list[list[int]]) -> int: ... ``` ## Example ``` grid = [ [0, 3, 1], [2, 0, 4], [1, 2, 0], ] min_detection_cost(grid) -> 0 # Path: (0,0)->(1,1)->(2,2), all zeros. grid = [ [1, 2, 3], [4, 5, 6], [7, 8, 9], ] min_detection_cost(grid) -> 21 # Path: 1->2->3->6->9 ``` ## Follow-ups 1. Now allow movement in all 4 directions. What algorithm would you use and why? 2. Some cells are completely blocked (cost = -1) — how do you handle that? 3. Return the actual path, not just the cost. 4. How would you solve this if you could move through at most one blocked cell for free?

InterviewDB Question

Sneaky Snack Run: Minimum Cost Path Through a Grid with Obstacles

phone

Question Details

Round 1 - Coding Problem A character wants to reach a snack at the far corner of a grid without being seen. Each cell has a detection cost (0 means safe, higher means riskier). Find the path from top-left (0,0) to bottom-right (M-1,N-1) that minimizes total detection cost. You can only move right or down. Example Follow-ups Now allow movement in all 4 directions. What algorithm would you use and why? Some cells are completely blocked (cost = -1) — how do you handle that? Return the actual path,…

Full Details

🔒

Unlock all Glean questions

Full insider details, leaked discussions, and candidate experiences.

Get full access — $100 a year, unlimited access

About This Question

This is a reported interview question from a glean interview during the phone round.

It covers the following topics: Coding, Phone, Onsite, Matrix .

Topics

Coding Phone Onsite Matrix

Sneaky Snack Run: Minimum Cost Path Through a Grid with Obstacles

Question Details

Full Details

About This Question

Topics

More Glean Interview Questions