7 kyu
Do you speak retsec?
556 of 2,823rrolt
Loading description...
Fundamentals
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.
python new test framework is required. updated in this fork
Approved
ceni taka, odgo boj!
Python translation kumited -- please check and approve
^_^
Now you can do it yourself ;)
I agree, this should rather be around 7 kyu (if not lower)
Increased the number of random tests in Ruby and JS (no idea about Haskell :-)
Re-ranked to 7 kyu
QuickCheck
executes100
tests for eachproperty
by default. If you want to specify the number of tests for a specificproperty
, you need to replaceproperty
withquickCheckWith stdArgs { maxSuccess = t }
wheret
is the number of random tests.But doing that means tests will never fail anymore. They'll only be logged to the console as failing ( you may have to unfold the test above to see that ), but the actual test will pass regardless. ( Yes, I'd like to know what I might have been doing wrong. )
Haskell translation kumited. I could have sworn I've already translated this kata, sorry.
Hey bkaes, sorry for the late approval. Thanks for your hard work, your transation has been added.
@rrolt: Don't worry, it's allright. Congratulations on your first approved kata!
A great kata. Good job. I would suggest a tweak to the existing diagrams (the X one is just plain confusing ;P)
Not 100% sure this is any better, but worth a try... ;P
Well, we don't have to resort to ASCII art…
@rrolt: Feel free to use the image for the description:
<center></center>
.Good job, @bkaes!
Changed to your image @bklaes, thanks. I aligned it on the left tho.
This is now resolved
I think the description is currently misleading:
That's not really reversing. That's reordering chunks. How about the following description?
If you want to use this description, you can copy the following markdown:
Sometimes, I think my comments are way to long compared to others. Sorry.
Thanks for the developped description, it is actually pretty fun compared to my basic one. I just used your if you don't mind, I also changed the title with your.
Given a little bit more time and consideration, I think "Do you speak retsec" makes more sense, as in "Do you speak English/German/Italian/French/…?". But I leave that decision to you. If you're happy with the description, mark this suggestion as resolved by adding a comment and checking the box at "Mark suggestion as resolved".
Right'o.
I am unclear as to what you mean. Can you provide some examples?
"Reverse the given string by its center. If a center character exists, reverse the string around it."
Examples yet provided :
"house" == "ho" + "u" (the 'center') + "se" -> "se"+"u"+"ho" -> "seuho"
"blue" == "bl" + "ue" (no center char.) -> "ue" + "bl" -> "uebl"
Is it clear enough now ?
Crystal! Thanks.
JS translation kumited. (Description modified : JS example added)
This comment has been hidden.
You're right. I assumed this should only be about "center character" but working with any "center" sounds better. I updated the kata.
This comment has been hidden.
Done. Thanks for your suggestions.