sum中写也是流式处理，这里的len()复杂度虽然是O(1) 但是它在里面生成列表的时候复杂度确实O(n) 所以空间复杂度相反是sum() < len()

脱裤子放屁

this is a bit complex to understand as a beginer but if you do, it is simple and short.

• The title is misleading, it has nothing to do with rectangles.
• The kata by itself is very nice.

Cracking this one cypher wasn't that easy, I really liked figuring the code out.

Excellent kata!

Approved

python new test framework is required. updated in this fork

Nice kata, but why is it named 'Rectangle' Cipher Puzzle?

Beautiful...

Nice. Better than sum() since len() is O(1), takes constant time.

This is because any string that is not '' is "truthy", much like how any number other an 0 (or 0.0) is also "truthy". Unlike, say, PHP, the string 'False' is also "truthy".

it would allso count 1 or 2 or 142892 for that matter but not int(0) or str("")