NeetCode #548LC-1102MediumHeap / Priority Queue
← Back to All Problems#548 · #1102 · Path With Maximum Minimum Value(得分最高的路径)
📌 Problem Statement & Constraints
Given an
m x n integer matrix grid, return the maximum possible score of a path from the top-left to the bottom-right corner, where the score is the minimum value along the path. You may move in the four cardinal directions. Constraints: 1 <= m, n <= 100, 1 <= grid[i][j] <= 10^9.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!