19
Luděk Reif
Last seen 1 year ago
Member for 8 years, 3 months, 20 days
Difficulty Normal
Jan. 16, 2020, 1:09 p.m. | + 3 | for max-count-bryukh |
Nov. 21, 2019, 8:41 a.m. | + 1 | for Comment Hetzroni: I'd suggest using isinstance(subs, list) for type checking, though even better isinstance(subs, coll... |
Nov. 21, 2019, 8:31 a.m. | + 1 | for Comment nivrammai: smooth, i definitely some new tricks in here that i am not familiar yet. |
Oct. 31, 2019, 7:29 a.m. | + 4 | for re-DiZ |
Oct. 31, 2019, 7:29 a.m. | + 3 | for Invariant-veky |
Oct. 31, 2019, 7:29 a.m. | + 3 | for with re.findall and generators-Phil15 |
Oct. 29, 2019, 6:23 a.m. | + 1 | for Comment Poshjark: First time it seems it's not cleat at all.. But in a minute it becomes very clear) Good solution) |
Oct. 24, 2019, 2:03 p.m. | + 1 | for Comment MaxLviv: good with lamda function |
Oct. 24, 2019, 2:02 p.m. | + 1 | for Comment rkozom: Very cool! |
Oct. 22, 2019, 7:41 a.m. | + 1 | for Task Cipher Map |
Oct. 17, 2019, 6:47 a.m. | + 1 | for Comment hckrtst: great use of decorators! |
Oct. 14, 2019, 5:06 a.m. | + 1 | for Comment danielkoo: Clear and easy to remember. Learned something today :) return f |
Oct. 11, 2019, 7:23 a.m. | + 1 | for Comment dmytroshurko_392f08d192604513a: Good solution: clear and concise. |
Oct. 8, 2019, 7:50 a.m. | + 1 | for Task Auto Painting |
Oct. 4, 2019, 7:49 a.m. | + 1 | for Task Cut Sentence |
Oct. 4, 2019, 7:31 a.m. | + 1 | for Task Morse Encoder |
Oct. 4, 2019, 6:02 a.m. | + 1 | for Comment obone: I see nothing creative here, sorry. :) |
Oct. 3, 2019, 2:19 p.m. | + 1 | for Task Three Words |
Oct. 3, 2019, 2:12 p.m. | + 4 | for First-dana77 |
Oct. 3, 2019, 1 p.m. | + 1 | for Task Achilles and the Tortoise |
Oct. 3, 2019, 12:34 p.m. | + 1 | for Dumb-obone |
Oct. 3, 2019, 12:15 p.m. | + 1 | for Task Caesar Cipher (encryptor) |
Oct. 3, 2019, 12:04 p.m. | + 1 | for Comment sanello: Ok! Thank you. I'm just learning to write codes, but I’ll keep this in mind for the future. ))) |
Oct. 3, 2019, 11:53 a.m. | + 1 | for First-Seikou_Matsuo |
Oct. 3, 2019, 6:24 a.m. | + 1 | for Comment art.hur: elements = [X1,X2,X3,X4,X5] elements[:-1] # [X1,X2,X3,X4] elements[1:] # [X2,X3,X4,X5] == compares a... |
Sept. 30, 2019, 7:58 a.m. | + 1 | for Comment Steven2222: Ooohhh. Short! Understandable. I like. |
Sept. 30, 2019, 7:57 a.m. | + 1 | for Comment Klemz: Nice one liner :) |
Sept. 26, 2019, 7:50 a.m. | + 1 | for Task The Hidden Word |
Sept. 25, 2019, 8:51 a.m. | + 1 | for Task Wild Dogs |
Sept. 25, 2019, 8:51 a.m. | + 1 | for Task The Secret Room |
Sept. 25, 2019, 4:21 a.m. | + 1 | for Task Compass, Map and Spyglass |
Sept. 24, 2019, 8:23 a.m. | + 1 | for Task Solution for Anything |
Sept. 24, 2019, 7:47 a.m. | + 1 | for Task Rotate Hole |
Sept. 24, 2019, 4:55 a.m. | + 1 | for Comment bsquare: Quick and clean, nice solution. |
Sept. 23, 2019, 5:17 a.m. | + 1 | for Comment vicentedealencar: same as: `return return len(Counter(elements)) < 2` |
Sept. 19, 2019, 2:33 p.m. | + 1 | for Comment 404.mikhail: I agree, classes (attributes, properties and methods) I'm just learning to use correctly |
Sept. 19, 2019, 1:27 p.m. | + 1 | for Knight class definition?-Sioul |
Sept. 19, 2019, 1:27 p.m. | + 3 | for Simple classes with property decorator-pseidel |
Sept. 19, 2019, 11:27 a.m. | + 1 | for Task Sort Array by Element Frequency |
Nov. 16, 2017, 10:11 a.m. | + 1 | for Task Largest Rectangle in a Histogram |
Oct. 8, 2016, 3:48 p.m. | + 1 | for Comment simonjtyler: A nice solution. I like the `int_to_romans` function that takes the symbols for the unit, five and t... |
Aug. 31, 2016, 5:58 a.m. | + 2 | for Xor-flex |
Aug. 31, 2016, 5:57 a.m. | + 1 | for Comment shshlomy: cool! but there is no need for the [2:] part. |
Aug. 4, 2016, 6:14 p.m. | + 1 | for Comment han97: it is not fast, better use sets and intersection method (set1 & set2) |
May 22, 2016, 12:06 p.m. | + 4 | for Second-gyahun_dash |
May 17, 2016, 7:04 a.m. | + 3 | for Do the math-nickie |
May 17, 2016, 7:04 a.m. | + 4 | for Complement-veky |
May 16, 2016, 12:02 p.m. | + 4 | for Bellman–Ford-ish (short)-StefanPochmann |
March 8, 2016, 5:57 a.m. | + 3 | for First-Amachua |
Feb. 22, 2016, 9:25 p.m. | + 1 | for Comment dana77: Cool solution! :) |
Feb. 22, 2016, 5:19 a.m. | + 3 | for detailed, fed pigeons list-dana77 |
Feb. 22, 2016, 5:16 a.m. | + 4 | for First-nikka |
Feb. 20, 2016, 7:30 a.m. | + 4 | for re.sub-gyahun_dash |
Feb. 19, 2016, 2:15 p.m. | + 3 | for A bit hacky-qria |
Feb. 19, 2016, 10:52 a.m. | + 3 | for First-a.i.sh986 |
Feb. 19, 2016, 10:51 a.m. | + 4 | for Multiple assignment in one line.-fantakeshi |
Feb. 19, 2016, 10:35 a.m. | + 4 | for sorted-Cjkjvfnby |
Feb. 19, 2016, 9:40 a.m. | + 4 | for First-abe.dillon |
Feb. 19, 2016, 9:38 a.m. | + 4 | for Simulated-PositronicLlama |
Feb. 19, 2016, 7:39 a.m. | + 4 | for First-JulianNicholls |
Feb. 19, 2016, 7:37 a.m. | + 2 | for Easy-ivansharapenkov |
Feb. 19, 2016, 7:37 a.m. | + 1 | for First-yawazar |
Feb. 19, 2016, 7:36 a.m. | + 2 | for roman-numerals-hedgeven |
Feb. 13, 2016, 4:07 p.m. | + 1 | for Task Univocalic Factaral |
Feb. 13, 2016, 2:53 p.m. | + 1 | for Task Vigenere Cipher |
Feb. 12, 2016, 5:03 p.m. | + 4 | for slice forward-blabaster |
Feb. 10, 2016, 6:24 p.m. | + 2 | for It was a hard day...-fedorpesyak |
Feb. 10, 2016, 6:21 p.m. | + 1 | for Comment fedorpesyak: The material about performance in the internet is very contradictory in the way of choosing between ... |
Feb. 9, 2016, 9:17 a.m. | + 4 | for First-hamukazu |
Feb. 5, 2016, 7:07 p.m. | + 1 | for Comment dana77: Hi! Really cool and original solution! I had to look at it twice to get what happens there (I'm not ... |
Feb. 5, 2016, 11:31 a.m. | + 2 | for clumsy&clear-dana77 |
Feb. 5, 2016, 10:40 a.m. | + 1 | for Comment dana77: Thank you for the comment! I didn't know that there is something like locals. Time to learn somethin... |
Feb. 4, 2016, 11:42 a.m. | + 4 | for First-takapt0226 |
Feb. 4, 2016, 7:12 a.m. | + 4 | for First-gyahun_dash |
Feb. 4, 2016, 5:32 a.m. | + 2 | for First-dana77 |
Feb. 4, 2016, 5:30 a.m. | + 3 | for First-dana77 |
Feb. 4, 2016, 5:24 a.m. | + 2 | for split, loop, join-dana77 |
Feb. 3, 2016, 9:39 p.m. | + 3 | for Second-senth |
Feb. 3, 2016, 8:09 p.m. | + 1 | for Comment andre_deregle: Wow! So easy and Pythonic... Great! |
Feb. 3, 2016, 1:17 p.m. | + 1 | for Task Restricted Sum |
Feb. 2, 2016, 8:16 p.m. | + 2 | for First-tomaslucovic |
Feb. 2, 2016, 5:44 p.m. | + 3 | for Speedy queue-hanpari |
Feb. 2, 2016, 5:42 p.m. | + 3 | for First-lok7chan |
Feb. 2, 2016, 5:41 p.m. | + 1 | for First-bukebuer |
Feb. 2, 2016, 5:41 p.m. | + 2 | for Double ended-veky |
Feb. 2, 2016, 9:23 a.m. | + 1 | for sorted lower case lists comparison-waxdesf |
Feb. 2, 2016, 9:18 a.m. | + 1 | for sorted-Sim0000 |
Feb. 2, 2016, 9:17 a.m. | + 3 | for First-MihaylovNikitos |
Feb. 2, 2016, 8:38 a.m. | + 2 | for First-mikeguo2014 |
Feb. 2, 2016, 8:35 a.m. | + 3 | for First-Amachua |
Feb. 2, 2016, 8:34 a.m. | + 3 | for Simple-Krischtopp |
Feb. 2, 2016, 8:28 a.m. | + 2 | for First-waxdesf |
Feb. 2, 2016, 8:26 a.m. | + 3 | for First-tomkun |
Feb. 2, 2016, 6:36 a.m. | + 2 | for First-ondysk |
Feb. 2, 2016, 6:36 a.m. | + 1 | for Comment ale1ster: Create a dict, mapping indices on the given array to the requested powers (_element ** index_). Then... |
Feb. 2, 2016, 6:34 a.m. | + 3 | for (em)powering-ale1ster |
Feb. 2, 2016, 6:33 a.m. | + 3 | for Second-narumi.kano.3 |
Feb. 1, 2016, 4:43 p.m. | + 2 | for First-nawbee45 |
Feb. 1, 2016, 2:40 p.m. | + 1 | for First-Artyom_Derevenets |
Feb. 1, 2016, 2:39 p.m. | + 3 | for Short and maybe scary?-nakanohito_piyo |