Yeah, I also faced with this bug :(

So its safe to say that you are just trying to reach the bottom right corner.

It is true ->
-> Sum_of_array = (sum_of_array (1,26) - num_1 - num_2) == num_1 * num_2,
but num_1 or num_2 > n (= 26) - so 175 > 26 - it is not correct.
The condition of the task - num_1 or num_2 <= n (26)

Palindrom would be read same from both sides... but we tak about ONE world, not two different. Those different's are reversals, like said in description.

My English is bad, so here is better explanation:

202 is palindrom.

102 is not.

201 is not.

201 and 102 are reversals to each other.

202 and 202 are ALSO reversals to each others.

(That the reason for excluding palindroms - each palindrom have same prime factor like reversal, because it's, by definition, same number).

Neither is a palindrome.

from what i know the aim is 5X5

Where did you get this from? The goal is to reach bottom right corner, no matter what size the maze has.

Description mentions N-1, but that's using 0-based indexing.

The bottom right corner is blocked by walls from both sides, so how could you reach it?

I'm certain i misunderstood something.

yup, first sentence of the description:

you can only move in one of the four cardinal directions

The n suffix means that the value is expected to be BigInteger and not Number.
You need to return a biginteger value of 1n.

You should return the n-th green number.

you used more than one loop?

Hi, can you share the data? (the input, your output, expected value, error messages, etc.) thanks

it would seem b here is not the object you think it is. try a type check.

What whitespace? You just have to fill the appropriate spots and forget about the rest.