NeetCode #627LC-1631MediumAdvanced GraphsNC 250
← Back to All Problems#627 · #1631 · Path With Minimum Effort(最小体力消耗路径)
📌 Problem Statement & Constraints
You are given an
m x n grid of heights. A route's effort is the maximum absolute difference in heights between consecutive cells. Return the minimum effort to travel from the top-left to the bottom-right, moving in the four cardinal directions. Constraints: 1 <= m, n <= 100, 1 <= heights[i][j] <= 10^6.🔒
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!