Minimum Time to Visit a Cell In a Grid at Atlassian

Hard56.3% acceptance

This problem has 62.5% frequency at Atlassian.

Problem Description

You are given a `m x n` matrix `grid` consisting of **non-negative** integers where `grid[row][col]` represents the **minimum** time required to be able to visit the cell `(row, col)`, which means you can visit the cell `(row, col)` only when the time you visit it is greater than or equal to `grid[r...

Read full problem and hints

Topics

Also asked at 3 companies


More Atlassian Questions

View all Atlassian questions