June 10, 2022, 10:11 p.m. |
+ 1 |
for Comment
syntaxwarrior04: clear and amazing example code
|
May 8, 2022, 7:16 p.m. |
+ 1 |
for Comment
dan_s_4390f63070a942b1ad6c766d: I like the idea of using the method Counter to solve this task. It's clear and readable
|
Feb. 28, 2022, 11:34 a.m. |
+ 1 |
for Comment
Selindian: Nice way to do it in one line. I like it.
|
Feb. 21, 2022, 9:27 p.m. |
+ 1 |
for Comment
CDG.Axel: There you are tricked yourself... Simply use previous solution and max (but remember about None as s...
|
Feb. 21, 2022, 9:25 p.m. |
+ 1 |
for Comment
CDG.Axel: Looks like best solution possible )
|
Feb. 13, 2022, 6:57 p.m. |
+ 1 |
for Comment
CDG.Axel: You are on a right way! Regex lookahead is a mark of a pro :)
|
Feb. 13, 2022, 6:56 p.m. |
+ 1 |
for Comment
CDG.Axel: With IDE reversed is easier to type, in most cases you only need to type 'rev{enter}'. But slice is ...
|
Feb. 12, 2022, 8:23 p.m. |
+ 1 |
for Comment
CDG.Axel: Cool! Btw you can use name[::-1] instead of reversed, it's slightly shorter
|
Feb. 12, 2022, 7:54 p.m. |
+ 1 |
for Comment
CDG.Axel: Cool! Bwt you slightly optimize cycle and sum: for day, _, duration in map(str.split, calls): d[day]...
|
Feb. 12, 2022, 7:50 p.m. |
+ 1 |
for Comment
CDG.Axel: re solutions looks cool, but totally incomprehensible at first glance:)
|
Feb. 12, 2022, 11:20 a.m. |
+ 1 |
for Comment
hbczmxy: It's concise! And it's very brief and very cool! But **I don't understand how it works?** Can you **...
|
Feb. 7, 2022, 10:13 p.m. |
+ 1 |
for Comment
orniton: Super fast and short. needs time to understand.
|
Jan. 28, 2022, 4:17 p.m. |
+ 1 |
for Comment
CDG.Axel: Straight programs often better than program with subfunctions!
|
Jan. 22, 2022, 6:05 a.m. |
+ 1 |
for Comment
viktor.chyrkin: shold not use min
|
Jan. 22, 2022, 5:59 a.m. |
+ 1 |
for Comment
Thenbacker: Again an excellent solution! I will look up Counter, I used a dict in my solution.
|
Jan. 22, 2022, 5:54 a.m. |
+ 1 |
for Comment
Sim0000: (min - 100) * 2 + 100 = 2 * min - 2 * 100 + 100 = 2 * min - 100
|
Jan. 22, 2022, 5:48 a.m. |
+ 5 |
for
Counter-Sim0000
|
Jan. 11, 2022, 10:21 p.m. |
+ 4 |
for
Unicodedata normalize-swagg010164
|
Jan. 11, 2022, 10:21 p.m. |
+ 3 |
for
keiです、ども(`・ω・´)-s.keigo.11235813
|
Jan. 11, 2022, 10:15 p.m. |
+ 5 |
for
Second - added use of combining()-robertabegg
|
Jan. 11, 2022, 10:13 p.m. |
+ 5 |
for
First-Oleg_Domokeev
|
Jan. 11, 2022, 4:59 p.m. |
+ 1 |
for Comment
viktor.chyrkin: nnnnniiiiccceee!
|
Jan. 11, 2022, 4:56 p.m. |
+ 1 |
for Comment
veky: Clear? Srsly? :-D
|
Jan. 11, 2022, 4:56 p.m. |
+ 1 |
for Comment
przemyslaw.daniel: as unclean as [this](https://py.checkio.org/mission/unique-email-addresses/publications/przemyslaw.d...
|
Jan. 11, 2022, 4:56 p.m. |
+ 1 |
for Comment
StefanPochmann: Is it not? :-). I do find it pretty straightforward, not particularly "creative" or what the other c...
|
Jan. 11, 2022, 4:55 p.m. |
+ 1 |
for Comment
veky: Well, "clear as mud" should probably be reworded into "clear as Stefan's regex". :-P In my view, eve...
|
Jan. 3, 2022, 7:01 a.m. |
+ 1 |
for Comment
hbczmxy: Your answer is very concise, I like it!
|
Dec. 31, 2021, 2:21 p.m. |
+ 1 |
for Comment
CDG.Axel: Optimization hints: - use filter(None, ...) to remove zeros - map(int, ...) shorter than int(i) for ...
|
Dec. 30, 2021, 10:26 p.m. |
+ 1 |
for Comment
bloodyrabbit: Nice concise solution, but according to PEP8 the use of an assignment statement that binds a lambda ...
|
Dec. 28, 2021, 6:21 p.m. |
+ 1 |
for Comment
juestr: The problem here isn't *style* though, and sometimes iterating over indices is appropriate even in P...
|
Dec. 27, 2021, 1:39 p.m. |
+ 1 |
for Comment
CDG.Axel: Great! But you can shorten code by one symbol: data.count(element) != 1 vs data.count(element) > 1
|
Dec. 27, 2021, 1:37 p.m. |
+ 1 |
for Comment
CDG.Axel: Great! But instead of list conversion you can use min() with key: return min(values, key=...)
|
Dec. 22, 2021, 10:12 p.m. |
+ 4 |
for
My favorite way of solving oduvan's missions :-P-veky
|
Dec. 21, 2021, 10:29 p.m. |
+ 4 |
for
First-Sim0000
|
Dec. 21, 2021, 8:01 a.m. |
+ 1 |
for Comment
veky: What's "this" in your "how does this work"? Though I assume your comment is just a rhetorical questi...
|
Dec. 20, 2021, 9:37 p.m. |
+ 4 |
for
I like to map it, map it-veky
|
Dec. 20, 2021, 9:09 p.m. |
+ 1 |
for Comment
veky: The point is, `next` is always called twice. Only we see it differently if it's called twice on the ...
|
Dec. 20, 2021, 9:03 p.m. |
+ 1 |
for Comment
veky: Why not? :-) More precisely, why would I copy the whole string just to add one character at the end?
|
Dec. 20, 2021, 9:02 p.m. |
+ 1 |
for Comment
veky: I assume you know that `map(f, a, b)` is a, b = iter(a), iter(b) while ...: yield f(next(a), next(b)...
|
Dec. 20, 2021, 7:57 a.m. |
+ 1 |
for Comment
CDG.Axel: Great! Btw zip_longest and inf isn't necessary: return [x for x, y in zip(items, [None] + items) if ...
|
Dec. 20, 2021, 7:57 a.m. |
+ 1 |
for Comment
CDG.Axel: Great! Btw you can slightly optimize code: return not len(set(string.ascii_lowercase) - set(text.low...
|
Dec. 20, 2021, 7:56 a.m. |
+ 1 |
for Comment
CDG.Axel: Perfect solution!
|
Dec. 13, 2021, 11:30 a.m. |
+ 1 |
for Comment
CDG.Axel: 'Simple is better than complex' is very debatable sentence. As for me 2 lines program always better ...
|
Dec. 13, 2021, 11:28 a.m. |
+ 1 |
for Comment
CDG.Axel: Good! But you may use standard zip this way: return [a+b for a,b in zip(a[::2],a[1::2]+'_')] PS: a[0...
|
Dec. 6, 2021, 3:28 a.m. |
+ 4 |
for
First-HiKaGe_2f7a7d6ea64442c9ac4b033
|
Dec. 6, 2021, 3:27 a.m. |
+ 4 |
for
Second-HiKaGe_2f7a7d6ea64442c9ac4b033
|
Dec. 6, 2021, 3:27 a.m. |
+ 4 |
for
First-not_speshal
|
Nov. 21, 2021, 12:55 p.m. |
+ 4 |
for
itertools.cycle-Sim0000
|
Nov. 21, 2021, 12:07 p.m. |
+ 4 |
for
split('a')-kurosawa4434
|
Nov. 20, 2021, 7:56 p.m. |
+ 1 |
for Comment
petergswhite: 'ap'[h>11] is clever. I wouldn't think to do that. For those who didn't get it, the boolean h>11 res...
|
Nov. 20, 2021, 1:54 p.m. |
+ 1 |
for Comment
juestr: Strictly speaking since `items` is an `Iterable` we shouldn't use `[]` on it. (The tests are bad.)
|
Nov. 16, 2021, 10:37 p.m. |
+ 1 |
for Task
Excel Column Number
|
Nov. 15, 2021, 5:50 p.m. |
+ 1 |
for Comment
Phil15: It is already there, just in the "check" part. You'll see it when our solutions can pass the still-u...
|
Nov. 15, 2021, 5:46 p.m. |
+ 1 |
for Comment
veky: PhD is not really helpful in this instance, but a good memory is. :-) About books... well, it depend...
|
Nov. 15, 2021, 4:33 p.m. |
+ 1 |
for Comment
Phil15: Unless I really missed something (I don't think so), there is one bad value in tests. And we wait fo...
|
Nov. 15, 2021, 4:33 p.m. |
+ 1 |
for Comment
Olpag: bad value in the test
|
Nov. 15, 2021, 4:33 p.m. |
+ 1 |
for Comment
Phil15: I like it! Just importing stuff, especially outside the standard library. But it would not work on t...
|
Nov. 15, 2021, 4:32 p.m. |
+ 1 |
for Comment
veky: Me and oduvan have a long history of him writing a mission and me solving it with [just an import](h...
|
Nov. 15, 2021, 4:27 p.m. |
+ 1 |
for Comment
veky: from openpyxl.utils.cell import column_index_from_string as column_number ;-D
|
Nov. 15, 2021, 4:17 p.m. |
+ 1 |
for Comment
Phil15: Unless "LibreOffice" and "Excel" name the columns in different ways, "ZY" would be the 701th column,...
|
Nov. 15, 2021, 7:37 a.m. |
+ 3 |
for
count-Sim0000
|
Nov. 8, 2021, 9:28 p.m. |
+ 1 |
for Comment
CDG.Axel: a slightly longer in symbols than with zip, but faster return sum([(b - a).total_seconds() for a, b ...
|
Nov. 4, 2021, 8:31 p.m. |
+ 3 |
for
First-Sebdidier
|
Oct. 31, 2021, 9:47 p.m. |
+ 2 |
for
One liner 59 symbols-CDG.Axel
|
Oct. 31, 2021, 4:49 p.m. |
+ 1 |
for Comment
koborC: I think it will not work if l[0] is 0. But I did not know "itertools.compress", so thank you for sha...
|
Oct. 31, 2021, 4:20 p.m. |
+ 2 |
for
With Yield-Adrian_Sanz_Wallace
|
Oct. 31, 2021, 4:09 p.m. |
+ 2 |
for
Second-eugene100372
|
Oct. 30, 2021, 6:43 p.m. |
+ 2 |
for
made easier using insert-Stensen
|
Oct. 28, 2021, 8:55 p.m. |
+ 2 |
for
First-Natalia_Popova
|
Oct. 25, 2021, 6:15 p.m. |
+ 1 |
for Comment
koborC: if you use "reverse = True" then use items.count(x) instead of ***-*** items.count(x). Also items.so...
|
Oct. 25, 2021, 6:13 p.m. |
+ 2 |
for
(-items.count(x), items.index(x))-flpo
|
Oct. 23, 2021, 11:19 a.m. |
+ 1 |
for Comment
seed5: If I understand the code correctly, the first part of **re.sub()** function, **' ?(\S+) ?'**, looks ...
|
Oct. 23, 2021, 11:03 a.m. |
+ 2 |
for
Regex-StefanPochmann
|
Oct. 23, 2021, 2:02 a.m. |
+ 1 |
for
Acceptable Password-KillEverythin
|
Oct. 23, 2021, 2:02 a.m. |
+ 1 |
for
Second-Vaishnav
|
Oct. 23, 2021, 1:58 a.m. |
+ 1 |
for
First-lexxPR
|
Oct. 23, 2021, 1:58 a.m. |
+ 2 |
for
First-HiKaGe_2f7a7d6ea64442c9ac4b033
|
Oct. 23, 2021, 1:58 a.m. |
+ 2 |
for
Second (='ω'=)-Magu
|
Oct. 20, 2021, 11:43 p.m. |
+ 1 |
for Comment
Kossak: Instead of unique() from 3'rd party module you can use set().
|
Oct. 17, 2021, 9:33 p.m. |
+ 1 |
for Comment
sawako.oono: Elegant solution, using the comparison of tuple; in tuple comparison if first element is same, then ...
|
Oct. 17, 2021, 9:23 p.m. |
+ 1 |
for Comment
mortonfox: That is needed because of the requirement of having to choose the smaller number if two numbers at a...
|