The one who does nothing makes no mistakes. Thank you for the literature, I will publish the code correctly in the future. Thank you :)

Unfortunately, we had to postpone this task for some time due to the lack of solution options. Perhaps I’ll come back to it when ideas for “simplifying” the algorithm appear.

Given the string, ("444996, 699990, 666690, 096904, 600644, 640646, 606469, 409694, 666094, 606490"), I got 45 unique substring comparisons. Based on this, 60 is the number of all “positions”, and 79 matching positions. And I can’t seem to get the correct percentage. Can anyone point me in the “right” direction?

The frustrating fact is that it took about 6 hours to solve this task. ●︿●

Quite an interesting task, it took me 2 evenings, I realized that it is difficult for me to navigate percentages, and I need to read the task more carefully. I'm pleased with the result.