Super clean and readable!

I thought that my solution which finds next_num(4028521680729008280092) is 5672520000485856186064 is quite optimal, its uses only about 78204 internal cycles (gap between polydivisible numbers is 1_643_998_319_756_847_905_972). But this is not enough.

PS. It turns out to be enough, but in the description it is written that there is a limited number of them, and after the last one in the test, my algorithm falls into an infinite loop.

PPS. I will not hide this hint under a spoiler, because I do not reveal the algorithm itself, but maybe I will save someone a lot of nerves and time.

when it seems you are doing the right thing and tests says no.
then you make such hard code

def sort_by_bit(arr):
    return [1, 2, 3, 4, 5, 6]

and the tests say that they don't care what you return.

Python translation

Python translation

Python translation

I don't know if it is possible in python not to create an instance of the class or the class itself to be able to address its attributes.

therefore, you have to make the NumClass itself, and in the tests create instance Num = NumClass(), on which the tests are made.

It is also possible to discuss the need to implement dunder methods for comparison (equality), arithmetic. because it wasn't in the original kata.

wow!
I upvoted this as best pratices, but not because I think it's a best practice, but so that more people will see it.

([2, 2],  0) False should equal True```

I thought that the condition says about non-empty subsequences, both "in the center" and on the edges. Wierd.

Double check your code.
I had false answer for this case too. Only because I compare correct addendums of checksum I found typo error in my code.

                 0   4   8   6   6   5   0   8   8    X
position      x  1   2   3   4   5   6   7   8   9   10
addendums are = [0,  8, 24, 24, 30, 30,  0, 64, 72, 100] 
the sum is 352  = 11*  35

author here. the description states "... but NOT 23:21:19", showing that the sequence must not be decreasing. It might have been confusing however, so I've altered the description. How's this?

I spent some time to detect both growing (increasing) and falling (descending) arithmetic progressions to comply with the rule 1.
But then spent more time to understand what needs to be detected only increasing (growing) arithmetic progression.

When I looked at the name of this kata, I thought that I would have to calculate the difference between bit arrays, not whole characters.

I think that the tests should have cases where the initial shift has such a value (near 26), that if you add the number of words, the result exceeds 26.

python random tests have \n endings, sample tests doesn`t.

Unfortunately, rejected due to fork superceded by saudiGuy fork