This kata's sensei hasn't been around since february 2018. Little chance this kata will ever be approved I guess.
Sorry for the late reply, but you are absolutely right! Fixed now.
Great kata that deserves more solutions. Thanks for creating it.
that's called copycats. can you give the links to the users profiles?
This solution is exactly the same solution as the reference solution, even the comments are the same. This must be a very big coincidence ...
Only //what? is added to not get a copy solution.
More equal solutions ...
This one and this one.
E W N S N N N E W S N
E W == 0
N S == 0
E W == 0
S N == 0
N N N
By eleminating E W and S N combinations N N N remains. Nothing wrong with this kata.
Great kata. Listen to this while finding a solution.
Real life coding challenges are defined whith less clear requirements most of the time.
It is even possible to extend this by thinking that 18 is odder than 24.
Take a closer look at your loop declaration.
for (int i = 0; i > 5; i++)
No wonder that your beans! are missing from the log I guess. (> != <)
Please read the earlier comments in this thread. You will see that you are not the only one having problems to solve this kata. Simply looping through the list is too slow. Try to search for articles about datastructures that can sort or search arrays very efficiently and you will find what you need.
Java translation is ready for review.
Your seventh column has two ones, and your eighth column has two eights. So, I'm sorry to say, but your answer is wrong.
In the Haskell Sample Test "should perform many-to-many JOIN and apply WHERE" a comparison without spaces is present. The EBNF-scheme therefor is not exactly correct, but imho this is not a big problem.