Draft
Word Frequency Table
61 of 65devtheory
Loading description...
Fundamentals
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.
fun kata, not sure whether this kata would be considered a duplicate: https://www.codewars.com/kata/5808ff71c7cfa1c6aa00006d yours asks for word counts, that one char counts, so probably good
Javascript translation sent! Please review and publish it :)
Cheers!
Maybe provide some edge-cases with words like "aren't"/"isn't" to see the different behaviour of
String#splitandString#scan. I hope I am not totally wrong, butString#scanwould split "aren't" into "aren" and "t"?The information about the difference between the correct result and user answer would be helpful. You could also provide a function skeleton and not force the user to write it by himself.
Shouldn't it be
frequencifierrather thanfrequencyfier?they're actually both not words but I guess you have a point. I'll rename.
btw, very elegant solution.