6 kyu
[BF] Sum 0 to N
58iNont
Loading description...
Fundamentals
Algorithms
Mathematics
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.
This comment has been hidden.
An opinion, not an issue.
Is it expected to output result in "decimal string"? The output is expecting "15" and my output is '\u000f'.
I'm ranking this a 7 due to the small input range. Had the range been 0 <= 255 I would have ranked it a 5.
For small input range, it do not make the result to be overflowed 256. So that everyone can practice BF using this kata at the beginning.
They can use this kata to find out how to handle with the convertion to plain number (I think this will be difficult for new leaner), so they will be able to solve more harder katas which is not only convert 0-255 (3 digits), like my BF N-th Fibonacci Number kata.
Of course, there will be kata like this but bigger input range and it will be more challenge as you want.. =D,, I hope you will understand me.
That's not an issue.
If you feel this kata is too easy, you can always make a harder version yourself ;-)
Yes, it's not an issue. Just meant to be feedback.
Perhaps you should add random tests ;-)
As
0 <= N <= 20, so there are only 21 possible cases and the program has been tested with all of these possible cases.I fixed this by shuffled all possible cases :D
You forgot to remove the dummy JS version
Removed :D Thank you~