This solution always returns a new object

fixed (Python)

Can confirm that caps lock on european keyboard behaves like permanently pressing shift key. This means caps lock and shift key at once negate each other.

The description should say "caps lock only matters to letters". From the tests we only know it doesn't apply to numbers but have to find out ourselves about special characters like comma or apostrophe.

Haha ok thank you I got it. But still it's quite hard for 7 kyu. I'm excited to see the other solutions.
/edit Ok if you got some experience in code golfing it looks much easier.

35 is too hard for 7 kyu. It took quite some time to figure out the shortest formula and then I can't get below 36 :-/

how is this best practice?

This is hard because the description is misleading with all that friendship stuff.
It should simply say that "numbers are in the same clan if they have the same subset of divisors (from the list). How many clans are there?"

From desc.: "2D array size tuple (width, height)"

It should be (but I also have problems with getting correct values):

(3,3)

[0,1,2]

[3,4,5]

[6,7,8]

==========

(2,4)

[0,1]

[2,3]

[4,5]

[6,7]

Well this is much too mathy for me. Does anyone have a better description, maybe a drawing?
I know basic geometry like calculating length of a vector and so on. But what even is meant here by "size"?

Changed to snake_case.

should be fixed

Actually that tip is kind of misleading anyways. The solutions don't use this coordination system and it would overcomplicate it.
Just use the common adding / subtraction / stretching of vectors.

Just put it in a variable flag = and hit Test / Attempt. No return necessary.