Yes, from the description:

The return value should be a 2d array cropped around all of the living cells.

thanks for the hint

Hi, did you ever figure this out? Your input is clearly length four and should have two bytes of padding.

This is most likely because you are mutating the input array, i suggest you just create a copy of fhe array and you should pass this issue

I failing with this:

Got
▓▓░░░░
░░▓▓▓▓
▓▓▓▓░░

instead of
░░░░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░
░░░░░░░░▓▓░░░░░░░░░░░░
░░░░░░░░░░▓▓▓▓░░░░░░░░
░░░░░░░░▓▓▓▓░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░

Yet the instructions state the world should be cropped around the living cells. If this is the case, then why is the test case above valid?

OK. Thanks :)

The world can expand, but should it also shrink? I.e. if there are no living cells on an outer edge, should that outer edge be removed from the world?

Only cells with exactly 3 neighbors become alive. The second cell has three neighbors that are alive (diagonals are included). The third cell does indeed have two neighbors, but only two, so it maintains whatever stat it had.

Yup this is the case

I accidently changed that back with my fork. Sorry about that.

I am getting the same thing.
Is there a way to get past this?

Edit: Ok all you need is to round(num, 4) - in Python.

Not a mathematical set. I'll change it to say "group".

Unclear on some things. So, each time a person drinks, they double and BOTH move to the end of the queue. So, after 5 drinks, everyone has doubled:

['Sheldon', 'Sheldon', 'Leonard', 'Leonard', 'Penny', 'Penny', 'Rajesh', 'Rajesh', 'Howard', 'Howard']

The 6th drink, Sheldon goes again, and doubles. Does this mean all instances of Sheldon double, or just the one drinking at that time? If it's just the one drinking the can, the queue becomes:

['Sheldon', 'Leonard', 'Leonard', 'Penny', 'Penny', 'Rajesh', 'Rajesh', 'Howard', 'Howard', 'Sheldon', 'Sheldon']

Is this correct?

The problem states:

"We can then assign a number to every word, based on where it falls in an alphabetically sorted list of all words made up of the same set of letters."

Words made up of the same set of letters can only be 'AB' and 'BA' - since we're dealing with a set? Yet the problem includes examples with 'AAAB', etc