I want to like this kata. But I don't understand why I have to manipulate strings and deal with newline characters in the input. It distracts from the problem at hand. (C++)

I really don't fully understand the problem, and I think I need some help. My understanding is that the grid is a top-down view of a map, and the cells with numbers on them are showing their "altitude". So assuming my understanding of the problem is correct, the simplest of tests is expecting the following to return 2:

010
010
010

But I can only see how this could return 1. To get from 0,0 to n-1,n-1 you only need to climb once. Please can someone help me understand the question better?

Some random tests do not work for my code. The strange thing is that the error message is 'should be 1 not false'. Whats wrong here? The instructions tell that the output should either be true or false!

I need some more clarification on "Number of climb rounds between adjacent locations is defined as difference of location altitudes (ascending or descending).".I'm looking at the test examples and I still don't get it.I know that I can solve it but I just don't understand what is being asked of me.

ok, I think, I got what you are trying to say.
If first resusive tree find the solution then return true otherwise backtrack and try another path
But I have no idea, How to achive this?
I really don't want to see the solution, I want to solve it

you need to re-read this: if this_recursive_call_returns_true(or if the destination has been reached by this recursive call) then return true
Roughly translates to: If this recusive tree has found the solution then return true

Top !

Thanks

Oh come on, format of the input could not be any simpler :) Parsing it is close to trivial for a kata of this rank.

I want to like this kata. But I don't understand why I have to manipulate strings and deal with newline characters in the input. It distracts from the problem at hand. (C++)

You need to climb up, but you also need to climb down, as last cell is of height 0. (climbing down also counts towards total climb rounds)

I really don't fully understand the problem, and I think I need some help. My understanding is that the grid is a top-down view of a map, and the cells with numbers on them are showing their "altitude". So assuming my understanding of the problem is correct, the simplest of tests is expecting the following to return 2:

010

010

010

But I can only see how this could return 1. To get from 0,0 to n-1,n-1 you only need to climb once. Please can someone help me understand the question better?

this was fun !!!! thank you

Some random tests do not work for my code. The strange thing is that the error message is 'should be 1 not false'. Whats wrong here? The instructions tell that the output should either be true or false!

I can't find a winning strategy unless this monster is not smart enough

I need some more clarification on "Number of climb rounds between adjacent locations is defined as difference of location altitudes (ascending or descending).".I'm looking at the test examples and I still don't get it.I know that I can solve it but I just don't understand what is being asked of me.

Seems you're smoked in fancy words, it is really simple.

Anything more than this would be like giving away the solution. :D

You can ask this at: https://gitter.im/Codewars/codewars.com/kata-solving-help

ok, I think, I got what you are trying to say.

If first resusive tree find the solution then return true otherwise backtrack and try another path

But I have no idea, How to achive this?

I really don't want to see the solution, I want to solve it

I think, MY code is doing what you are saying.

It is returing true if It reached n-1 n-1 position

you need to re-read this:

`if this_recursive_call_returns_true(or if the destination has been reached by this recursive call) then return true`

Roughly translates to:

`If this recusive tree has found the solution then return true`

No, not yet right.

The last three recusive calls would never be executed.

I've told you what to do in my first message.

Yes.

You don't compute factorial like this(in python):

## Loading more items...