Build the next version of the Unix sort command, this time with the -r flag baked in. Given a list of lines, return them sorted in descending order by character code (the exact reverse of v1's order, like LC_ALL=C sort -r: lowercase letters come before uppercase ones), joined by newline characters (\n). Duplicates are all kept. If the list is empty, return the empty string.
Function signature:
sortLines(lines)
Example:
Input: lines = ["banana", "apple", "cherry"] Output: "cherry\nbanana\napple" When printed: cherry banana apple
Sort ascending first, then call
.reverse(). Or pass a comparator. Either way, copy the array first to avoid mutating the input.
The full solution:
class Solution {
sortLines(lines) {
const sortedLines = [...lines].sort().reverse();
return sortedLines.join("\n");
}
}
Free plan: 30 tutor messages. Premium is unlimited.
Saved
Ctrl + Enter to check
