Hope you had fun! Good job, and congratulations!

After a considerable effort and with the help of the Web, I was finally able to solve this mystery! Great KATA!

I enjoyed solving this kata, but my solution, which uses backtracking with constraint satisfaction, only passes 204 tests!

Nice kata, thanks!

After some effort, I finally solved it. VERY NICE KATA.
This website really helped me out! http://www.conceptispuzzles.com/index.aspx?uri=puzzle/skyscrapers

Hi,

1. spoiler flag, please
2. you don't need the first approach here, if you programmed the other one correctly

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 allocated Pair. 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.