6 kyu
Your Ride Is Here
502 of 1,119russelljjadams
Loading description...
Algorithms
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.
Please use new python test framework.
Done.
No random tests.
Added.
Python 3 should be enabled.
Seems fixed
Clojure tests are missing.
re-upping this, still missing after a year
Thought instructions to find mod of product was actually to find mod of all integers placed side by side turned into new number... my bad. surprisingly, it actually worked for first 5 test cases.
Trying to solve this using Clojure. CLicking "Submit" shows that all tests pass, but I can't submit a final solution and the kata does not appear in my list of completed challenges.
Haskell random testcases produce long strings (more than 6 letters, as specified in description). What is expected behaviour? why "JKJBTADDXDVQEIRPRQG" and "HUZEQFIXJRLDSSDFGMUFXZVVQMITTQJKPMAPYBUZMXHKIQBPGBEW" -> go "RQGOTYEHRSYPMMKSLNQZTHSUHMZSPITMBIWFLYPWIFNOANFKNLUDKTHIOX" and "SMDZMJRJDOTCOOFJXIWHKQQZAZMBFEJLKFZZBATJQQWKPQYSUTWKHINZRTZZGVDZUCJCXOXEUJ" -> go ?
Fixed. Maximum string length reduced according to the description.
Thanks!
This comment has been hidden.
Fixed. Maximum string length reduced according to the description.
CoffeeScript translation published.
Built the solution but it tells me the first test case should be STAY even though it is the example in the description that results in a GO being tested. The test cases assert GO and STAY respectively but I get an error saying neither should be GO.
You should specify the language where you encounter that behavior.
Sorry, forgot to mention that. It was in Python that I was having the issue.
There are plenty Python solutions that worked fine with the example. I think your solution may be invalid. Can you post it here? (Do not forget to mark it as spoiler).
Not an issue.
The 6th test fails during Python submission with no clues as to why.
It did not fail for me... Can we see your solution?
Also, to get some clues, consider using
printto see the arguments and go through your solution with those arguments. It might help.Not an issue.
Nice Kata =)
Thanks Dan!
Ruby translation kumited.
(Description modified)
Approved. Thank you!
I did a Clojure translation. It's my first translation so let me know if I need to do anything besides publishing it.
It's been approved, thank you for the contribution sir.
JS translation kumited.
(Description modified)
Translation approved. Thank you.