There aren't any issues in either the Sample or Submit tests. For the directed graph with a single edge graph = {a -> b}, solve_graph('a', 'a', graph) should evaluate to true since you have already reached vertex a by starting at vertex a - there is no need to traverse any directed edge to reach the desired destination.

This test looks wrong. Array has 23 positions and the answer has 36.

snail([[1,2,3,4,5,6],[21,22,23,24],[32,33,34],[36,31],[28,29,30],[12,13,14,15,16]]) -
Expected: '[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36]', instead got: '[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 32, 33, 34, 35, 36, 31]'

I might be misunderstading..?

For reference I had a bug in my code but somehow that seems to mess with the result in the above assertion.

what do U mean not valid?

The last test is checking the case when not a valid object was passed as an argument

Got the same ........ and as Arosemena said: "details said the decimals must be truncated to 2 decimals not rounded :)", but the description says: "Your objective is to add formatting to a plain number to display it as price."

When I calculate price, I always thnink of rounding down or up, dont You ?

My suggestion is to mark in the description "no rounding". The word price is misleading here imo.

I read the first three words and got a massive clanging sound in my brain...
My error checking is not what it should be.

Think your 1.100 is the result of a parsing, but may be the argument you parsed wasn't a valid one and Description says:

function should return a string 'NaN' if the input is not a valid number

Lost on why 1.100 is NaN, if I knew why I coud fix it... Don't want to workaround for the specific value, am I missing something?

Solved it, my knowledge of the RegExp object is a bit sharper now.

Wow a lot of people are stuck, me too!

Been trying to regex word boundaries which works the majority of the time and others it just doesn't 'bc' being my main problem. I see you are being pretty helpful, I'd love to know where I am going wrong.

It's probably just late and I can't think straight. tried the same strings in a regex processor and it works as I would expect..

Last one fails but not much feedback, I am thinking one of the parameters is an object so it needs to recurse but there is no clue. Would be useful if we knew what the response was supopsed to be.

I have been thinking abou this for days, still don't think my solution is too elegant but I beat it in the end!

I am having problems with the string reverse kata. The test engine keeps telling me that I have a invalid end of input. I tried my solution in IRB and it works as expected.

NM. It was an issue with all custom test cases. Should be good now.