22
Hrvoje
http://blog.hrvoje.org/
Last seen 2 years ago
Member for 10 years, 1 month, 12 days
Difficulty Normal
Trying to make everything a one-liner and sometimes failing miserably. :)
Creative! Here's a trick I've found useful for grouping into k-sized chunks, it might help down the road.
zip(*(iter(list_name),) * chunk_length)
More
First - X/O Referee-divided.hr
You got it working, now try writing it again without the boring repetitions. :)
More
First-divided.hr
You don't need the stuff after the 1, simply count('1') will work just fine. :)
More
Very nice, clear and effective! :) Here are few tips:
You don't need the max(max(pyramid)), the maximum is in the last sublist, so a simple **max(pyramid[-1])** is enough.
Instead of list comprehension in the 2nd line, you could have used **map(list, pyramid)**.
*for i in range(len(something))*
More
First - Number Base-divided.hr
That's nice and clean. Good practice is not catching all exceptions, just the one you want to handle, otherwise programs fail silently while appearing to work.
In this case, try **except ValueError:**
More
Just ... wow. I didn't know about lru_cache and had to improvise with dict(). Also, never seen lambda *args. 5 thumbs!
More
Short-StefanPochmann
This is very elegant, especially the odd ^=1 followed by a multiplication. Megalike! :)
More
Cool! You could also simply return the first==second. If both sides compare equal, it will return true. :-)
More
It might be more "*pythonic*" to import string and then use string.ascii_lowercase, but I like this solution - simple and interesting. Well done! :)
More
This is a clever way, well done!
**all** is also very handy and could come useful, for example:
return all(chr(i) in text.lower() for i in range(97, 123))
More
Might be easier to write if a+b+c <= 2*max...? You also don't really need the else.
Niiiice work! :)
More
