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.
a nice tap!
fixed in latest fork
Approved
python new test framework is required. updated in this fork
sen yarra yemişsin
Is not clear what's the return value if the discriminant (b^2 - 4ac) is negative.
Should return false,-1, 0?
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)?
What does a negative ratio and a negative target value means in the context of this kata? Is it even specified? Does it even make any sense to expect any values?
Reference sometimes (albeit very rarely) fails at some boundary cases in random tests:
Such edge cases should be added to sample tests as well.
Any difference with looping through
smileys
first then check membership inarr
?a
parameter is pointless if1
is always passed in as the argumentUnpublishing due to low satisfaction rating and many not fixed issues.
@eijni Thanks about the tip. I was not sure if you had to tag as a spoiler for comments also :) I'm new to this discuss board.
Loading more items...