Only God knows. Setup and allocation requirements of many old C kata are true mystery.
No, seriously now: what your solution has to return is a dynamically allocated array of pointers to Pair, where each pointer points to an individually, dynamically allocatedPair. Don't ask me why, but there's more kata with such setup.
I have added some comments and example code in the initial solution, hopefully it will be easier to understand what is required
Thanks!
Nice kata!
Only God knows. Setup and allocation requirements of many old C kata are true mystery.
No, seriously now: what your solution has to return is a dynamically allocated array of pointers to
Pair, where each pointer points to an individually, dynamically allocatedPair. Don't ask me why, but there's more kata with such setup.Maybe just try it in another language.
In C, why the returning parameter is a double pointer ?
Great Kata!
Sort of yes, but in a smart way!
If you just try to compute all the possible slides with brute force your code will time out because the number of possibilities can be gigantic.
This comment is hidden because it contains spoiler information about the solution
Hi! Did you complete it? I'm stuck with the same problem I can see in other comments: getting 1064 instead of 1074 using JS.
Edit : OK, it seems my question was dumb. I'll keep thinking for an other way and checking my code.
This comment is hidden because it contains spoiler information about the solution
Nice Kata!
Nice Kata!
In C++, the "TEST" case does not work. But, the "ATTEMPT" case works!
Nice kata !
Loading more items...