Well this made me solve it in 2.5 seconds :p

:whistling:

Puzzle pieces being unique, you'll never encounter two different pieces that could be assembled with the same third one. So to say: borders are unique.

:whistling:

;)

The answer to this question is crucial to solving this kata. It's not apparent from the description, but after reading this comment, I realise I have waisted some time with a way too complex back-tracking strategy.

Had the same bug on 50/4187 => turn your ints to long long should fix..

I've just done it (before seeing your message), using standard markdown link format.

its called a freebie and its spelled fun.enjoy:)

And ~7 kyu in Ruby.

Thanks! (That will be really helpful for me)

@Hana1989, Thank you for the suggestion, but I think I will keep it the way it is for now.

In addition, I would add some syntax validate (e.g. the function will return None for invalid tags)

plz, don't wake up FArekkusu... ;o

Yeah it's okay now. You need to click RESET to see the changes in the sample tests

Hi,
IMO, The idea is nice but the tests are way too easy..
You could use diffrent amount of spaces between the tags, lower/upper case, etc'.
In addition, I would add some syntax validate (e.g. the function will return None for invalid tags), but this is up to you.

Maybe this is why my solution fails :-(
I've passed the 1500x1500. How far am I?

Nice kata :)
I think that some details are missing in the description -

1. Are duplicates allowed? (yes)
2. What about diagnols? (ignore)

Submitted by mistake :(