Give me more information. Do you get an exception? Whats not working about the code?

Sorry about that! I'll get to fixing right away.

If you liked this one check out my interpreter challenge! http://www.codewars.com/kata/rubyfunge-interpreter

How do we put links into the kata description?

Great kata! Gives me some ideas for some new ones!

Good to know, I'll build it so it prepends a new memory location to the front of the data.

Quick question, what is the expected behaviour if we use the '<' instruction and the pointer currently points to the first memory location (0)? For example, what would be the expected pointer location if the code vaariable was just '<'?

I am deeply confused. The goal of the kata is to return a list of all the perfect squares, in ascending order, from an array of numbers. 4 definately is a perfect square, and belongs in the final result of that test. I am going to mark this as resolved, since this seems to be a non-issue.

I did say in order but I didn't specify descending or ascending, it is fixed now, thank you!

I wholeheartedlyy agree

Lots of time outs on submission but, I feel the instructions need to be clearer. I keep failing the tests on the one where it just gives you a TreeNode. I'm not entirely sure what we are supposed to return. If I just return the node it still fails the test...

#         <- Printing out the input
TreeNode  <- Printing out what type of input
[#]       <- Printing out the end result
Test Failed: Tree with one element