4 kyu
Path Finder #2: shortest path
953 of 4,904evk
Description:
Task
You are at position [0, 0] in maze NxN and you can only move in one of the four cardinal directions (i.e. North, East, South, West). Return the minimal number of steps to exit position [N-1, N-1] if it is possible to reach the exit from the starting position. Otherwise, return false.
Empty positions are marked .. Walls are marked W. Start and exit positions are guaranteed to be empty in all test cases.
Path Finder Series:
Algorithms
Similar Kata:
Stats:
| Created | Jun 18, 2016 |
| Published | Jun 18, 2016 |
| Warriors Trained | 21378 |
| Total Skips | 6994 |
| Total Code Submissions | 32925 |
| Total Times Completed | 4904 |
| JavaScript Completions | 953 |
| C++ Completions | 936 |
| Python Completions | 1967 |
| Java Completions | 634 |
| C# Completions | 440 |
| Julia Completions | 22 |
| Rust Completions | 109 |
| Total Stars | 642 |
| % of votes with a positive feedback rating | 96% of 806 |
| Total "Very Satisfied" Votes | 744 |
| Total "Somewhat Satisfied" Votes | 54 |
| Total "Not Satisfied" Votes | 8 |
| Total Rank Assessments | 4 |
| Average Assessed Rank | 4 kyu |
| Highest Assessed Rank | 4 kyu |
| Lowest Assessed Rank | 5 kyu |
