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.
I tried my best to get [X, Y] as a result, but in the end I was just required to get Y
very dirty explanation
Approved
python new test framework is required. updated in this fork
This is good job!
I am not sure where Codewars rules say thay you need to be as fast as possible :)
i mean, codewars is sbout doing it as fast as possible, even if its extremely ugly
Oh boi, I really wanted to flex with those one liners the first time I saw them.
Seems like I'm on the right path to get all the girls.
Since every character in the string has to be touched, assuming 'n' refers to the size of 'aeiouAEIOU' -> 10
String comparison method:
vowel, equal frequencies: 5.5 checks
not a vowel: 10 checks, constant
Set, assuming underlying b-tree has minimal depth:
vowel, equal frequency: 1 * .1 + 2 * .2 + 3 + .4 + 4 * .3 = 2.9 checks
not a vowel: upper bound of 4 checks, lower bound 3 checks
Comparing: vowel 5.5 vs 2.9 -> ~1.90 faster for set
not a vowel: 10 vs 3 to 4 -> 3.33 to 2.5 times faster, in theory
Note: this is in theory, the python interpreter and execution environment could make this worse or better
Obviously as 'n' gets (not much) larger, the set is going to be faster. For n = 10, I would say tradeoff is speed versus speed of coding
Can someone please explain what is happening here?
And why the time complexity of this solution is O(n)?
The explanations I have seen suggest that for short lists sorting and slicing can be faster but sorted() starts to chug on big lists, so min() max() is better practice when you don't know how big the list is going to be.
Things that "would be nice" are not usually kata issues; please use the "suggestion" or "question" tags as appropriate.
The description was updated some time ago to reflect this.
Random test are failing, and it is impossible to find issue, because generated input is not provided.
expected Array(16) to deeply equal Array(16)
Would be nice to provide input that wass passed to this test.
Not sure from where you're getting:
...because if you're referring to the example in the description, that one is:
and that is correct.
A natural
is indeed four half-steps belowD flat
.You would achieve
G flat
by descending four scale steps belowD flat
(in the key of Db major), but the kata is not dealing with scale steps; it's chromatic differences (half-steps) that are being used here.Since you are posting as an
issue
, I would ask that you clarify exactly what the problem with the kata is?Loading more items...