bro has dedication

BAHAHHHAHAHAHHAHA

shameful

7 palabras
E-S-E-N-C-I-A

Ката очень веселая и интересная. Автор в инструкции к этой кате нагнал жути! Только от "акцентов", "окончательных знаков препинания", "составных имен" становится страшно. Я с перепугу установил пакет unidecode,перечитал все о кодировке UTF8. А в результате просто собрал все "акценты" и подозрительные знаки в кучу и заменил их на пустоту в Другом имени. Не забыл еще привести к одному регистру эти два имени. И всех дел! Автор молодец! Супер! Я получил удовольствие от ката.

I haven't opened codewars since very long time. I open my email and I find your reply, 12 months after my comment lol.

By saying there are no constraints I meant none were specified in the question. Of course we're limited to the resources used to run the code and our code should run under 12 seconds. But I was asking how did you come to the conclusion that 2520 will be the maximum possible case in this scenario.

Anyways it's not that important. Thanks for your reply. Wish you all the best.

There are always constraints. On codewars we are constrained by the resources given to us and the amount of time alloted to pass. There are n that are both practically and theoretically impossible to compute within those time and resource constraints. Can anyone's solution here actually compute up to 2520 in those 12 seconds on codewars' system?

LMFAO

where did bro get this data from 😭✌️😹

love it!

This is great... It took me almost a minute to scroll to the bottom... :-D

Well it may not be the intended solution, but it is faster AND more readable than any other solution here.

why did you stop at 2520? there were no constraints in the problem, and the number 2520 isn't common, it's usually a power of 10 or power of 2

u have sick mind bro.LOL