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 liked it as -best practice-, because the best practice it is!
my qualm with this is how does it function when p changes? from my understanding, lru cache should reset every time you call cut_log which means that you should have to recalculate every single time. but for some reason it works?
This solution only works untill n=15
This comment is hidden because it contains spoiler information about the solution
And it looks like you saw the solution that I copied instead of the actual one I used
I copied that solution because I felt it is better to use if I would you use it in some other place
I understand what you just said,
but what I don't understand is the usage of functools and the function lru_cache
Do you mind telling why you used it, even though everything will work well if you didn't use it?
To simplify, I just prepare a list of prime numbers instead of checking every integer.
That's pretty much it.
My solution is similar to your, but I don't understand your usage of all these stuff
I really like the dictonary for the final result.
This comment is hidden because it contains spoiler information about the solution
First, you should never claim something is faster without actually benchmarking it. Python has many hidden optimizations in built-in functions.
Second, I guess my solution would be faster in most cases because
any
stops at the firstTrue
, andall
stops at the firstFalse
, so it would only reach the end of the sequence if it consists of all equal elements. Your algorithm will reach the end in any case. Consider the situation[True, False, ...(10000 elements more)]
. My algorithm will stop after checking the first two elements; yours will check all the sequence in any case.On the second thought, it would be faster in any case except, maybe, some very short sequences, because the first value of predicate would be either
True
orFalse
, so one of theany
orall
functions is guaranteed to stop after checking it.For your solution, I missed the iterator part in map. yes, the space complexity will be O(1) but then it is a slower iteration over sequence. a simple loop should be faster. Mind me I understand that they both are O(n) time complexity but simple loop should be a faster O(n) out of those two. let me know what you think.
How exactly creating new structures in memory can be more efficient? This solution has O(1) space complexity.
i think counter method is more efficient space wise. however , it has same time complexity
approximate equality is now used for
average_if()
Loading more items...