Everything Blind4Basics said has come up for me as well as the output of 'minute 1 15 16 17 0 10 20 30 40 50\nhour 0\nday of month 1\nmonth 1\nday of week 1' should equal 'minute 0 1 10 15 16 17 20 30 40 50\nhour 0\nday of month 1\nmonth 1\nday of week 1' is TERRIBLE to read and Im sure you could come up with a better way of solving it.

Please make the directions better. This line isn't necessary and is misleading as it is one of two exapmples According to crontab.guru 5 4 31 2 * would occur “At 04:05 on day-of-month 31 in February.” And overall they're just hard to read

A duplicate of https://www.codewars.com/kata/optimized-pathfinding-algorithm.

other needed edge case:

• loops in the grid (even if you use the requirement I'm suggesting, you need that kind of tests to dscriminate some wrong approaches
• what about rectangular grids?

use bigger grids for the examples: the 2x2 is totally useless to understand the task. A 4x4 would be a good idea, with several paths (valid and not valid ones), then explaining how many of them are valid and lead to True

either way, it's missing random tests

Hi,

sorry, but you did a duplicate: https://www.codewars.com/kata/search/my-languages?q=blackjack (note: most of them are in JS or ruby => select "all languages" to see them)

=> you should unpublish it.

cheers