understood the mistake
of the julian calendar year % 100 != 0 - superfluous
really don't understand why...

Hello my code passes tests with years > 1752
and where < 1752 are lost for several days (1, 3 ... somewhere around 10)
in tests, the rule of the julian calendar?
(year % 4 == 0) and (year % 100 != 0) ?
Or am I misunderstanding something, please tell me

print(f'Хах)) спасибо на добром слове)) И тебе всего хорошего + удачи ^^')

Wow, didnt expect to get an answer.
I even forgot)))
I solved this task with the "clumsy" method. Far from in not 30 minutes(((
Thank you very much, man. Very nicely explained
I'll add more from myself. Try to solve task on a piece of paper in the usual way, and then write this logic in the program code.

you need to create a program that looks at this list and understands which letter is followed by , i.e. look at the example 'w' in front of all letters, i.e. its index is 0 then see 2 letter in turn goes 'h',
yes just look at the example there are several sheets carefully look at what letter after which it is after that type in turn and now your word is ready, I did in 30 minutes , its a good kata

No random tests?

I'm sorry, very ... help explain the condition, please (((
what do they want from me?(((

You should read this : https://docs.codewars.com/training/troubleshooting/

And if it's not a secret, can you tell me more, please?
Сan i print the tests themselves or the behavior of my code on the tests?

Your Code is not visible as it would be tagged as spoiler. You can simply print the array and it will be visible in the log of the test cases. After that just manipulate the test cases to pass the test.

you are just a genius, handsome, nanomachine, PROGRAMMER!!!
my brain flutters!!!

To anyone who doesn't understand the assignment: You have an array e.g [-2, 1, -3, 4, -1, 2, 1, -5, 4] You now have to find out which part of this array gives the biggest sum. In this case, it would be [4, -1, 2, 1] because 4 - 1 + 2 + 1 = 6. No other uninterrupted sequence in that array gives you a bigger sum.

Thank you very much, I got the idea, I will try

Thanks...but what methods should I use?
Should obtain correct maximum subarray sum in 10 random tests with array size 10000 <= size <= 20000 and with integer entries -100 <= n <= 100

Testing are endless. No matter how you optimize the code, there are more and more checks

I'm certainly good... using 3 cycle for such a task...(sarcasm)

Sorry, but could you please point me in the right direction?