Skills:"ruby and python are on display this evening. if you'll just make that one stop with me first, i know you'll find it fascinating. and i'll get you to the falcon on time."
I personnaly tend to disagree on that ("cleaner") for python, at least when nested map/filter/reduce stuff enter the place, because you have to write the code in reversed order compared to the logical reasonning. That's one point where python is very bad... JS or ruby are much clearer, for that. Same happens for nested comprehensions.
doesn't work for uppercase.
instead of using enumerate, you could just also assign two values to dict to determine (count, isupper)
Yes,I think of enumeration as well.
Oooof, I'm embarassed by my pattern now. TIL about
\2
.it turns out that there is no difference between max(0, n) * max(0, m) and max(n, 0) * max(m, 0)?
but what if 2.4?
yeah, Well done
I thought about that as well. This is possible in O(N).
I personnaly tend to disagree on that ("cleaner") for python, at least when nested map/filter/reduce stuff enter the place, because you have to write the code in reversed order compared to the logical reasonning. That's one point where python is very bad... JS or ruby are much clearer, for that. Same happens for nested comprehensions.
note: spoiler flag ;)
This comment is hidden because it contains spoiler information about the solution
Thank you!
it just depends on my mood... ;o (here it makes the code a bit shorter)
Why do you prefer using map() instead of list comprehension? Is it faster? Maybe I have to use map() more often.
I dont like the complexity O(N^2) :(
gago ang galing amputa!!
Loading more items...