6 kyu
Number Sequence: Smarandache descrescendo symmetric sequence
122 of 156rsa
Loading description...
Algorithms
View
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.
Haskell translation
The description previously only had Python-specific code blocks. As there's a C++ translation, I'm not sure how the addition of Haskell-specific code blocks would affect the description there.
Quite an easy and simple kata to enjoy solving.
In the description you didn't mention that n is the first argument that the function takes so it was confusing before clicking on train
Don't know if that was there when you raised this, but it's there now. Closing.
Либо примеры построены неверно, либо описание не до конца ясное. Должна ли последовательность убывать после достижения максимума? n - это каждый n-ный элемент (не включая нулевой), тогда пример построен не верно где solve(2,4), если последовательность убывает! Или последняя строка последовательности должна просто достигать до максимума без продолжения?
Not too sure about the purpose of the large tests in python. My algorithm was pretty naive and I didn't do anything fancy but still passed. Maybe just have small tests or really ramp it up. To that end mine took like 5 seconds to just complie the test code so that should be sped up too.
I agree. And the input range should be specified in the ddescription and reduced since there are actually no perf requirements anyway.
C++ translation:
https://www.codewars.com/kumite/5fbd0513f45e5b002c546935?sel=5fbd0513f45e5b002c546935
Thank you!
"random tests/should work with large numbers" is a single test with a fixed number. It should be under "basic tests/should work with larger numbers".
thanks, regrouped the tests.
Missing edge case test with
bound == 1
. And it's not clear ifbound
can be< 1
.thanks, Note added