Unique Paths
Nobody has claimed this yet.
Assessment
- Difficulty
- 2/5
- Estimated time
- 1-3 hours
- Newbie friendliness
- 48/100
Research direction
Start with the Unique Paths problem and explanation linked in the issue, then inspect the unique-paths directory in the repository. Add the solution there and verify that it matches the linked problem requirements and examples.
Written by the indexing model from the issue text.
Description
- Dominant language
- Python
- Stars
- 156
- Forks
- 359
- Avg merge
- 1d 16h
- Merged PRs (30d)
- 38
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
More from DaleStudy/leetcode-study
-
problem
Difficulty 2/5 1-3 hours Newbie friendliness 65/100
DaleStudy/leetcode-study#288 · 1 reaction ·
-
Set Matrix Zeroes Openproblem
Difficulty 2/5 1-3 hours Newbie friendliness 68/100
DaleStudy/leetcode-study#283 · 3 reactions ·
-
problem
Difficulty 2/5 1-3 hours Newbie friendliness 62/100
DaleStudy/leetcode-study#274 · 1 reaction ·
-
problem
Difficulty 2/5 1-3 hours Newbie friendliness 65/100
DaleStudy/leetcode-study#267 · 1 reaction ·
-
problem
Difficulty 2/5 1-3 hours Newbie friendliness 62/100
DaleStudy/leetcode-study#252 · 1 reaction ·
All issues in DaleStudy/leetcode-study
Similar issues
-
bug ci good first issue
Difficulty 2/5 1-3 hours Newbie friendliness 88/100
-
Difficulty 2/5 1-3 hours Newbie friendliness 76/100
-
documentation
Difficulty 2/5 Half a day Newbie friendliness 62/100
inmanta/inmanta-core#10835 ·
-
Difficulty 1/5 Under an hour Newbie friendliness 92/100
-
sponsored
Difficulty 2/5 1-3 hours Newbie friendliness 65/100