NeetCode #713LC-63Medium2-D Dynamic ProgrammingNC 250
← Back to All Problems#713 · #63 · Unique Paths II(不同路径 II)
📌 Problem Statement & Constraints
A robot moves right or down from the top-left to the bottom-right of an
m x n grid that contains obstacles marked 1. Return the number of distinct paths; obstacles may not be entered. Constraints: 1 <= m, n <= 100, obstacleGrid[i][j] is 0 or 1.🔒
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!