6 kyu
Shorter Path
372 of 605Nancy27
Description:
You are given a list of directions in the form of a list:
goal = ["N", "S", "E", "W"]
Pretend that each direction counts for 1 step in that particular direction.
Your task is to create a function called directions, that will return a reduced list that will get you to the same point.The order of directions must be returned as N then S then E then W.
If you get back to beginning, return an empty array.
Fundamentals
Similar Kata:
Stats:
| Created | Jan 21, 2016 |
| Published | Jan 22, 2016 |
| Warriors Trained | 1146 |
| Total Skips | 98 |
| Total Code Submissions | 2269 |
| Total Times Completed | 605 |
| Python Completions | 372 |
| C# Completions | 107 |
| Java Completions | 143 |
| Total Stars | 26 |
| % of votes with a positive feedback rating | 92% of 197 |
| Total "Very Satisfied" Votes | 171 |
| Total "Somewhat Satisfied" Votes | 21 |
| Total "Not Satisfied" Votes | 5 |
| Total Rank Assessments | 56 |
| Average Assessed Rank | 6 kyu |
| Highest Assessed Rank | 5 kyu |
| Lowest Assessed Rank | 8 kyu |
