You don't need the arbitrary join(':') after reverse() since sort() coerces the nested arrays to strings for you. That means you can avoid having to split again later.
I think you can even shorten (if I'm not mistaken) your solution by reducing one .map down and doing like me the surrounding in your first call to the .map method!
Should such a .surround method exist in String.prototype? I have came accross several cases where I would need it like in a WYSIWYG editor. But I don't want to risk proposing such a method to the community haha!
Good take btw!
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Lets do it:
It's pretty straightforward:
split(';')
gets us allName:Surname
.map(n=>n.split(':').reverse().join(':'))
reverses them to beSurname:Name
.sort()
sorts them alphabetically.map(n=>
(${n.split(':')[0]}, ${n.split(':')[1]}).toUpperCase())
reformats every name (uppercase it, place parentheses and commas).join('')
, which transforms the name array to an output stringHere is the output:
Same but different:
You don't need the arbitrary
join(':')
afterreverse()
sincesort()
coerces the nested arrays to strings for you. That means you can avoid having to split again later.But Amin is right:
That's way shorter! Thanks a lot for the input
I see we got a similar solution you and I!
I think you can even shorten (if I'm not mistaken) your solution by reducing one
.map
down and doing like me the surrounding in your first call to the.map
method!Should such a
.surround
method exist inString.prototype
? I have came accross several cases where I would need it like in a WYSIWYG editor. But I don't want to risk proposing such a method to the community haha!Good take btw!