7 kyu
Simple string division
346 of 1,078KenKamau
Loading description...
Fundamentals
.avif)
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.
C#
method name should be
PascalCase(Please refer to implementation of backward compatibility here )should use
stringinstead ofStringtypeProlog translation
C Translation
python new test framework is required. updated in this fork
Approved
I don’t understand why many kata creators think that we are here to solve puzzles, and not to solve programming problems.
I thouth it's too hard for 7 kyu, but I took pen and paper and it turned out to be quite simple. Thanks!
it's a hard 7 kyu. Thanks for the tip.
I think there are problem in test cases.
This comment has been hidden.
Let me confirm.
What edits would you recommend to fix this?
This comment has been hidden.
Thanks. That's the culprit. I'll update.
This comment has been hidden.
My 64-bit code now passes the test, without truncating. The fix worked for me.
Thanks for the help @Spindle.
All the examples show an ordered given string but then when you click "attempt" it runs the test with strings that are not in order. It would be nice to have more representative examples.
Description updated.
C++ initial solution and tests are using underclared stuff.
Not sure what stuff is.
I see that your own solution is quite inefficient. It would be good to revamp it into something efficient as during the random tests it consumes much more time than the so-far-submitted solutions do.
This comment has been hidden.
The description does not specify that there should be at least one digit in every partition that is created by inserting comma(s). This may be obvious, but it is better to specify it explicitly.
....its obvious...
The description speaks of inserting commas in the input string, but then the example does not insert commas in the string, but splits the string into multiple strings. It would be better if the description were consistent on this point.
perhaps you can suggest some wording?
May be this?
I would in fact redefine
kto mean the number of partitions, instead of the number of splits.