7 kyu
Sort and Transform
676 of 1,677PG1
Loading description...
Fundamentals
Strings
Arrays
Sorting
Algorithms
This comment has been reported as {{ abuseKindText }}.
Show
This comment has been hidden. You can view it now .
This comment can not be viewed.
- |
- Reply
- Edit
- View Solution
- Expand 1 Reply Expand {{ comments?.length }} replies
- Collapse
- Spoiler
- Remove
- Remove comment & replies
- Report
{{ fetchSolutionsError }}
-
-
Your rendered github-flavored markdown will appear here.
-
Label this discussion...
-
No Label
Keep the comment unlabeled if none of the below applies.
-
Issue
Use the issue label when reporting problems with the kata.
Be sure to explain the problem clearly and include the steps to reproduce. -
Suggestion
Use the suggestion label if you have feedback on how this kata can be improved.
-
Question
Use the question label if you have questions and/or need help solving the kata.
Don't forget to mention the language you're using, and mark as having spoiler if you include your solution.
-
No Label
- Cancel
Commenting is not allowed on this discussion
You cannot view this solution
There is no solution to show
Please sign in or sign up to leave a comment.
JS: Node v12 should be used along with its appropiate assertion tools (Mocha + Chai). Refer to this and this
Done
Not my most efficient solution, at the very least it sharpened up my typing.
What does "sorting alphabetically" mean?
It is the lexicographic order :
https://chortle.ccsu.edu/java5/Notes/chap92/ch92_2.html
Triple coming in agn ~~
Coffeescript
Crystal
Julia
Sweet, approved
A real example would be useful in the description, along with some formatting (like
"asdf-...")i dont understand how katas with no valid explaind example are proven it would save so much time and for the sensei it would be super easy to do i think its something that the admins might want to consider
Fixed, plus updated test framework for python
This comment has been hidden.
Hey ho, I've submitted a C# Translation Could you please review and submit? :)
Approved
If the last part of string is sorted alphabetically, how come it is "wedg"?
As noted already, the instructions are very unclear: upon simply reading, it is impossible to know how one "derives" letters from number.
There's a slight hint at step 4, but frankly this "derive" operation should be described as what it is: obtaining the ASCII sequence matching the number sequence.
Agreed terrible instructions!
Instructions are not very clear.
"d) the same as above, post converting the array into ASCII characters and sorting alphabetically."
Ruby translation
Please review and approve.
Approved
Python translation
Please review and approve.
Approved
Haskell : https://www.codewars.com/kumite/5c201ae1eb914217fd0000cf?sel=5c201ae1eb914217fd0000cf
Approved
;-)
Added.