Beta
The Shortest Path To Travel The Whole Grid: Obstacles Only On The Last Row
Loading description...
Graphs
This comment has been reported as {{ abuseKindText }}.
Show
This comment has been hidden. You can view it now .
This comment can not be viewed.
- |
- Reply
- Edit
- View Solution
- Expand 1 Reply Expand {{ comments?.length }} replies
- Collapse
- Spoiler
- Remove
- Remove comment & replies
- Report
{{ fetchSolutionsError }}
-
-
Your rendered github-flavored markdown will appear here.
-
Label this discussion...
-
No Label
Keep the comment unlabeled if none of the below applies.
-
Issue
Use the issue label when reporting problems with the kata.
Be sure to explain the problem clearly and include the steps to reproduce. -
Suggestion
Use the suggestion label if you have feedback on how this kata can be improved.
-
Question
Use the question label if you have questions and/or need help solving the kata.
Don't forget to mention the language you're using, and mark as having spoiler if you include your solution.
-
No Label
- Cancel
Commenting is not allowed on this discussion
You cannot view this solution
There is no solution to show
Please sign in or sign up to leave a comment.
Are the solutions of the first kata even correct? I find that your ref sol here has in many cases -1 moves than the expected min number of the other kata.
The main difference between this 2 Kata is that going back to the beginning point or not
For this one, you can save 1 step in certain situation, because you can end at anywhere.
Ending at one of the particular points will save you 1 step. But these points might not always exist, so you will see it has 1 less in some cases, but not all.
Let me edit the description to make it clearer, also I will put some hints.
ah ok
Random tests are vulnerable to input modification.
Forgot about this, now user will be given a copy of grid, should be fixed.
.