7 kyu
Race Ceremony
615 of 1,821yagopajarino
Loading description...
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.
you will be in trouble if the input is 5, there is no reasonable output for those 3 conditions.
Not a kata issue.
The task is ratty style :)
Php translation added :) .Please review and approve.
Approved
This comment has been hidden.
This comment has been hidden.
bruteforce is possible too
Please review and approve, thanks !
Approved
Why: racePodium(100000) shouldBe (33334,33335,33331)
And not: racePodium(100000) shouldBe (49999,50000,1)
?
From the description:
The first place platform has the minimum height possibleRight! thanks :)
Nice kata!
This comment has been hidden.
Please fix typo " minimum height >>posible<< "
Fixed :)
Resolved
Scala translation
Approved
D translation
approved
Julia translation
approved
Pretty difficult kata. But it was exciting
I don't understand how to calculate the output. I know what to return, and the order within the array, but not how to divide it. What do they mean by "minimum height possible"? Looking at the examples, the winner (middle) place is sometimes half, but sometimes not.
Help??? :)
This is what you have to figure out by yourself. The description gives all the elements to find the result. Minimum height posible just means what it says: if you find some combination but there exists another possibility that satisfies all the other requirements with 1st being lower, then your solution is incorrect. It's not as obvious as one could think at first sight, but I think any hint would definitively spoil the solution. If you cannot find it out, a good option can be to move on to other katas. Someday maybe the answer will pop into your mind with clarity.
Great challenge. It was harder than I expected it to be.
Factor translation
Approved
Swift translation
C++ translation
Approved
NASM translation, please review carefully.
Approved by someone.
Translations available for review:
Rust, JS, Go approved.
Cobol, C and Haskell approved.
Someone's on a roll!!! ^^
Approved
Mathematicstag should be addedDone
Description should be language-agnostic (function names removed)
Also regarding
return an tuple, it should be returnarray / list/ tuple based on the trained language (refer sample tests)as this kata will likely get approved and receive translationsDone
I suggest to rename the parameter more explicitly
blocks, as it was originally.Done
Typo in the description: avalible.
Not marked as an issue since this could send the kata to draft...
Thanks!
There are always 3 places, the result should be a tuple.
Instead of the [2nd, 1st, 3rd] you suggest a (2nd, 1st) return value?
[2nd, 1st, 3rd]->(2nd, 1st, 3rd)Done :)
You don't mention the preferred height for 2nd place. It appears you want it to be as close as possible to 1st place. Spec should be updated.
Yeah you're right about the 2nd place height. I'll update the spec. Thanks for the feedback!!
fixed