Loading collection data...
Collections are a way for you to organize kata so that you can create your own training routines. Every collection you create is public and automatically sharable with other warriors. After you have added a few kata to a collection you and others can train on the kata contained within the collection.
Get started now by creating a new collection.
That sentance is about the output format.
My comment is asking about the input format. One of the examples is
"24:01:01" -> "00:01:01"
.My solution mutates the original input. Just wondering if that's actually acceptable?
I genuinely am shocked this is fast enough.
Love the active pattern. Nice find.
Solution is a bit greedy. I suppose more cases means less stack calls.
Really do NOT love overly math-y problem in bash. Literally the wrong tool for the job. Oh well, I got some experience with
bc
syntax I guess.This comment is hidden because it contains spoiler information about the solution
JavaScript needs a test case where the total time is more than 24.0 hours. This might invalidate several solutions.
This won't work for races that take more than 23 hours, 59 minutes, 59 seconds...
This comment is hidden because it contains spoiler information about the solution
Assuming this is javascript.
_
in a function usually means "unused parameter". If this is the callback to.match
or similar, then the first parameter is the entire match while the second parameter is the first capturing group.Marking my satisfaction with this Kata as "None" because only the two example seperators are used (dash & underscore). Considering it is suggested that you write your own tests, I was not expecting the examples to be exhaustive.
Please either improve the description or make this Kata more challenging.
Note that I learned C++ in 2010 and have not used the language professionally. I also have never manually created a tree structure. I wanted to complete this kata without looking up the "accepted way" of creating a tree.
After much reading I realized that my process was causing values to be deconstructed. Whoops. What a rookie mistake.
This comment is hidden because it contains spoiler information about the solution
I'm really struggling with this one. Namely I haven't done explicit pointers in a while.
Anyway, every time I try to test the output says both the left and right sides of the assertion are "unsupport types".
I can output the root of the tree (std::cout) and everthing seems fine. https://imgur.com/a/ZNize
Loading more items...