post your solution

with spoiler flag, then

all i can say is post your solution and there is no timing constraints (i.e it;s simple) and firstly solve referenced kata at bottom

Hi, i am pretty new on codewars. I have tried this kata but I am always time out... I have tried several different approach but can't find how to reduce the cost of the algorithm... Would not mind for some suggestions. I do not know if I need to post my code.

You're welcome.

Oh, ok. Thanks. I'll try to think about it)
P.S. nice kata)

You should take each square with its all adjacent squares or rectangles to form the resulting true rectangles list.

The pink and the blue squares aren't adjacent, you can't replace one of them with the yellow one and form another rectangle.

I have a question. Looking at the example with 22 * 6, I still can not understand why the answer is (12 * 6) (12 * 6), but only 2 times. If you can also connect the blue and pink squares. Or why 16 * 6 only once, if the yellow and pink square can be replaced by blue. I think that the correct answer should be ['(4 * 2)', '(12 * 6)', '(12 * 6)', '(12 * 6)', '(6 * 4)', '(18 * 6) ',' (10 * 6) ',' (10 * 6) ',' (10 * 6) ',' (16 * 6) ',' (16 * 6) ',' (16 * 6 ) ',' (22 * 6) ']
can you explain to me why I'm wrong?

fixed

Nice kata, got a sloppy solution but I might come back to it later...

Python: Actual and expected answers are swapped in tests.

approved

Go translation awaiting approval. The test cases mirror that used in the Python translation.

Thank you for your previous and current feedback. :)

Great, that you brought this cool kata back! And now with free order of the results!