Web Reference: A path that the robot takes cannot include any square that is an obstacle. Return the number of possible unique paths that the robot can take to reach the bottom-right corner. The robot must find a path from start to finish without passing through any obstacles. Your task is to calculate the total number of unique paths the robot can take to reach the destination. An obstacle and space are marked as 1 or 0 respectively in grid. A path that the robot takes cannot include any square that is an obstacle. Return the number of possible unique paths that the robot can take to reach the bottom-right corner. The testcases are generated so that the answer will be less than or equal to 2 * 109.
YouTube Excerpt: Unique Paths
Information Profile Overview
Leetcode 63 Javascript Unique Paths - Latest Information & Updates 2026 Information & Biography
Details: $8M - $20M
Salary & Income Sources
Career Highlights & Achievements
![Celebrity [Java] Leetcode 63. Unique Paths II [DP Distinct Ways #3] Wealth](https://i.ytimg.com/vi/NbDAxypYCcc/mqdefault.jpg)
Assets, Properties & Investments
This section covers known assets, real estate holdings, luxury vehicles, and investment portfolios. Data is compiled from public records, financial disclosures, and verified media reports.
Last Updated: April 5, 2026
Information Outlook & Future Earnings
Disclaimer: Disclaimer: Information provided here is based on publicly available data, media reports, and online sources. Actual details may vary.