LOL, nice one you seems really having fun doing it
I like it, verbose yet performant.
woah, nice to know the side effect man
Ahhh, such a clever, flexible and beautiful way to do it. It can expand to use additional parameter for how many people to mention first.
This comment is hidden because it contains spoiler information about the solution
indeed 'almost everyone', it's very readable and easily understood we use predefined methods, of course we can define faster sort. eg. using .replace(/./g,...)
You doesnt have to sort the word on each loop. cache the sorted word, then compare in the loop
Plus, I would rather avoid mutating string prototype, if every developer mutates string prototype, it gonna be a sphagetti with spices
we have similar logic
we have similiar logic
Loading collection data...
LOL, nice one
you seems really having fun doing it
I like it, verbose yet performant.
woah, nice to know the side effect man
Ahhh, such a clever, flexible and beautiful way to do it.
It can expand to use additional parameter for how many people to mention first.
This comment is hidden because it contains spoiler information about the solution
This comment is hidden because it contains spoiler information about the solution
This comment is hidden because it contains spoiler information about the solution
This comment is hidden because it contains spoiler information about the solution
indeed 'almost everyone', it's very readable and easily understood
we use predefined methods, of course we can define faster sort. eg. using .replace(/./g,...)
You doesnt have to sort the word on each loop.
cache the sorted word, then compare in the loop
Plus, I would rather avoid mutating string prototype,
if every developer mutates string prototype, it gonna be a sphagetti with spices
This comment is hidden because it contains spoiler information about the solution
we have similar logic
we have similiar logic
we have similiar logic