Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

63. Unique Paths II #224

Open
ShivamKaushik316 opened this issue Oct 9, 2023 · 2 comments
Open

63. Unique Paths II #224

ShivamKaushik316 opened this issue Oct 9, 2023 · 2 comments
Assignees
Labels
enhancement New feature or request good first issue Good for newcomers hacktoberfest hacktoberfest contributions

Comments

@ShivamKaushik316
Copy link

Description

Dynamic Programming

DSA Problem

You are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n - 1]). The robot can only move either down or right at any point in time.

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.

@ShivamKaushik316 ShivamKaushik316 added enhancement New feature or request good first issue Good for newcomers hacktoberfest hacktoberfest contributions labels Oct 9, 2023
@ShivamKaushik316
Copy link
Author

plz assign me this issue

@ShivamKaushik316
Copy link
Author

ShivamKaushik316 commented Oct 9, 2023

#227 Kindly review my PR

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request good first issue Good for newcomers hacktoberfest hacktoberfest contributions
Projects
None yet
Development

No branches or pull requests

1 participant