| Sept. 7, 2019, 12:31 a.m. |
+ 1 |
for Comment
bsquare: Hey. Some suggestions: - you don't need the brakcets in the first line where you extract hour, minut...
|
| July 24, 2019, 3:20 a.m. |
+ 4 |
for
 First-jcg
|
| June 14, 2019, 12:05 a.m. |
+ 1 |
for Comment
Ilis: My first thoughts was use permutations too, but then I tried to subtract broken segments from digits...
|
| June 13, 2019, 8:58 a.m. |
+ 1 |
for Comment
Ilis: Well documented
|
| June 11, 2019, 4:27 p.m. |
+ 1 |
for Comment
Sim0000: I use following formula. # calculate area of intersection of data[i] and data[j] def intersection(i,...
|
| June 11, 2019, 7:28 a.m. |
+ 1 |
for Task
Black Holes
|
| June 11, 2019, 1:50 a.m. |
+ 3 |
for
 First-Sim0000
|
| June 10, 2019, 11:01 p.m. |
+ 1 |
for Comment
Marlen_Nurmakov: This is clearly creative. What is the point of weak_spot = min(bricks) if you don't use it in patter...
|
| May 28, 2019, 1:36 a.m. |
+ 1 |
for Comment
rherron: Nice recursive solution and use of isinstance()
|
| May 15, 2019, 6:44 p.m. |
+ 1 |
for Comment
Wienands: Thnak you.
|
| May 11, 2019, 10:51 p.m. |
+ 1 |
for
 ก็็็็็็็็็็็็็ʕ•͡ᴥ•ʔ ก้้้้้้้้้้้-vmiimu
|
| May 11, 2019, 10:51 p.m. |
+ 1 |
for Comment
vmiimu: True; one liners are enjoyable to attempt as a learning exercise. However, not very practical when i...
|
| May 11, 2019, 8:49 p.m. |
+ 1 |
for Comment
Wienands: this time no comprehension :)
|
| May 11, 2019, 8:48 p.m. |
+ 2 |
for
First-Wienands
|
| May 11, 2019, 8:44 p.m. |
+ 1 |
for
Second-lodgeinwh
|
| May 9, 2019, 8:03 p.m. |
+ 4 |
for
 Bunny's simplified-nickie
|
| May 7, 2019, 12:53 p.m. |
+ 3 |
for
 Simple-Pouf
|
| May 2, 2019, 6:07 p.m. |
+ 1 |
for Task
Digits Doublets
|
| May 1, 2019, 8:13 p.m. |
+ 3 |
for
 First-cs1g
|
| May 1, 2019, 8:10 p.m. |
+ 1 |
for
First-tanya
|
| May 1, 2019, 8:07 p.m. |
+ 1 |
for
First-brownie57
|
| April 25, 2019, 8:51 p.m. |
+ 1 |
for
 just split()-nickgryg
|
| April 25, 2019, 3:34 p.m. |
+ 1 |
for Comment
danielmiller20: Nice (but it's kinda cheating though).
|
| April 23, 2019, 10:10 a.m. |
+ 4 |
for
 First Conversion into CamelCase-Takafumi_Yamanobe
|
| March 31, 2019, 7:52 a.m. |
+ 1 |
for Comment
Dmitry_Dieiev: Like it! Few notes: v.3.5.2 m[0] isn't valid; used m.group() instead. Maybe it is more robust? Besid...
|
| March 28, 2019, 8:07 a.m. |
+ 3 |
for
1-liner: split & capitalize-przemyslaw.daniel
|
| March 28, 2019, 7:19 a.m. |
+ 1 |
for Comment
Takafumi_Yamanobe: Amazing!
|
| March 27, 2019, 5:45 p.m. |
+ 1 |
for Comment
quarkov: Can not disagree with the title =)
|
| March 26, 2019, 5:54 p.m. |
+ 3 |
for
 First-LexCavalera
|
| March 26, 2019, 5:26 p.m. |
+ 3 |
for
 First-eugene100372
|
| March 26, 2019, 5:22 p.m. |
+ 2 |
for
First Humpty Dumpty Form-Takafumi_Yamanobe
|
| March 26, 2019, 5:20 p.m. |
+ 2 |
for
Use tau-Dima_Shul_chevskij
|
| March 26, 2019, 5:20 p.m. |
+ 2 |
for
First-thealfest1
|
| March 26, 2019, 5:19 p.m. |
+ 2 |
for
First-s_o_va
|
| March 26, 2019, 5:18 p.m. |
+ 1 |
for
 recursive, but I wish I understood how to use *unpacking-UpwardTrajectory
|
| March 12, 2019, 10:18 p.m. |
+ 2 |
for
 DFS Version-BigDaiTJ
|
| March 12, 2019, 3:24 p.m. |
+ 2 |
for
First-Oleg_Domokeev
|
| March 12, 2019, 3:05 p.m. |
+ 2 |
for
Simple - 15 lines-thealfest1
|
| March 4, 2019, 7:45 p.m. |
+ 4 |
for
 strptime and strftime|-mplichta
|
| March 4, 2019, 7:45 p.m. |
+ 1 |
for Comment
mplichta: I had the same idea [strptime and strftime](https://py.checkio.org/mission/time-converter-12h-to-24h...
|
| March 4, 2019, 7:44 p.m. |
+ 1 |
for Comment
quarkov: Banned "sum"? Pfff, hold my beer! *Typing "s" + "um" instead of "sum". Oh, I like it!
|
| March 2, 2019, 2:22 a.m. |
+ 1 |
for Task
 The Hidden Word
|
| Feb. 28, 2019, 3:55 a.m. |
+ 1 |
for Comment
hyl3rid: words is passed as a list. sum variable is set as 0 to count for words found. for loop is created to...
|
| Feb. 19, 2019, 4:40 p.m. |
+ 1 |
for Comment
Ofir_Lavi: lol
|
| Feb. 15, 2019, 7:36 p.m. |
+ 3 |
for
 Non Unique-davelivingstone
|
| Feb. 14, 2019, 1:59 p.m. |
+ 3 |
for
 First-NexTg.Loki
|
| Feb. 14, 2019, 1:55 p.m. |
+ 1 |
for Comment
NexTg.Loki: I recommended read a bit more about tuple [comparison](https://docs.python.org/3/reference/expressio...
|
| Feb. 12, 2019, 5:15 p.m. |
+ 3 |
for
 (-items.count(x), items.index(x))-flpo
|
| Feb. 11, 2019, 5:16 a.m. |
+ 2 |
for
 First-MBM_1607
|
| Feb. 11, 2019, 5:16 a.m. |
+ 2 |
for
First-MSL
|
| Feb. 11, 2019, 5:16 a.m. |
+ 2 |
for
trim top/bottom and transpose-tokyoamado
|
| Feb. 10, 2019, 8:23 a.m. |
+ 3 |
for
 First-tobytobytoby
|
| Feb. 7, 2019, 7:26 a.m. |
+ 3 |
for
Using recursion-levi-rs
|
| Feb. 3, 2019, 4:05 a.m. |
+ 2 |
for
 groupby-flpo
|
| Feb. 2, 2019, 8:43 a.m. |
+ 1 |
for Task
Calculate Islands
|
| Feb. 2, 2019, 5:21 a.m. |
+ 1 |
for Task
 Solution for Anything
|
| Feb. 2, 2019, 3:42 a.m. |
+ 1 |
for
 lambda love-unCoVered
|
| Feb. 2, 2019, 3:41 a.m. |
+ 1 |
for
Sort a list with absolute key-frankiser
|
| Feb. 2, 2019, 3:41 a.m. |
+ 2 |
for
First-acarpioanon
|
| Feb. 1, 2019, 4:42 a.m. |
+ 1 |
for Comment
kurosawa4434: Thanks Denis_Gerashchenko :) Another expression: d1 = [] for n in NUMS: if n >= lit_left and n <= (l...
|
| Feb. 1, 2019, 12:46 a.m. |
+ 1 |
for
 digit(f)-flpo
|
| Feb. 1, 2019, 12:28 a.m. |
+ 3 |
for
intersection, issubset, union-kurosawa4434
|
| Jan. 31, 2019, 11:46 p.m. |
+ 1 |
for Comment
ljwoodward: Is this clear? I have no idea what is going on here. Like what is 'f'? and where is 'str' in the fin...
|
| Jan. 31, 2019, 5:07 a.m. |
+ 2 |
for
First-fierce_mark
|
| Jan. 31, 2019, 5:07 a.m. |
+ 2 |
for
First-archius11
|
| Jan. 31, 2019, 5:06 a.m. |
+ 3 |
for
First-elisaif
|
| Jan. 31, 2019, 5:06 a.m. |
+ 3 |
for
Сombinations-Olpag
|
| Jan. 31, 2019, 5:06 a.m. |
+ 3 |
for
First-LeDar
|
| Jan. 31, 2019, 4:58 a.m. |
+ 2 |
for
Sets-karwowskit
|
| Jan. 29, 2019, 3:30 p.m. |
+ 2 |
for
 The Warriors-ioginy
|
| Jan. 29, 2019, 3:10 p.m. |
+ 1 |
for Comment
Phil15: Do you know classes?
|
| Jan. 27, 2019, 6:22 a.m. |
+ 3 |
for
 Duh-StefanPochmann
|
| Jan. 27, 2019, 5:39 a.m. |
+ 3 |
for
4 problems 1 solution-StefanPochmann
|
| Jan. 27, 2019, 12:20 a.m. |
+ 1 |
for Task
 Double Substring
|
| Jan. 27, 2019, 12:20 a.m. |
+ 1 |
for
First-tom-tom_f993b3abc4814d4cb5476e
|
| Jan. 26, 2019, 9:25 p.m. |
+ 1 |
for Comment
alex.solonencko: The list "alphabet" might be created in a bit easier way: alphabet = [chr(x) for x in range(ord('a')...
|
| Jan. 26, 2019, 1:06 a.m. |
+ 1 |
for Task
 The Angles of a Triangle
|
| Jan. 25, 2019, 8:06 p.m. |
+ 3 |
for
 Second-takurei
|
| Jan. 25, 2019, 3:13 p.m. |
+ 3 |
for
 The meaning of life-Sisyphus
|
| Jan. 25, 2019, 3:12 p.m. |
+ 3 |
for
I'm sure you'll agree-StefanPochmann
|
| Jan. 25, 2019, 3:11 p.m. |
+ 1 |
for
shortself-veky
|
| Jan. 25, 2019, 3:44 a.m. |
+ 3 |
for
 Second-Chocolater
|
| Jan. 25, 2019, 2:49 a.m. |
+ 3 |
for
 First-thomaspmassa
|
| Jan. 22, 2019, 12:28 a.m. |
+ 1 |
for Comment
skorski.anthony: Is it really supposed to be "clear"? IMO, it clearly is not: * nested comprehension abuses are defin...
|
| Jan. 21, 2019, 4:32 a.m. |
+ 3 |
for
 Simpler O(n^4)-DiZ
|
| Jan. 15, 2019, 9:24 p.m. |
+ 3 |
for
 First-Sim0000
|
| Jan. 13, 2019, 9:51 p.m. |
+ 1 |
for Comment
vit.aborigen: Thanks for the review
|
| Jan. 13, 2019, 7:03 p.m. |
+ 3 |
for
 Regexes all the way-ale1ster
|
| Jan. 13, 2019, 5:36 p.m. |
+ 1 |
for Task
Striped Words
|
| Jan. 13, 2019, 5:32 p.m. |
+ 2 |
for
 First-martin21eden
|
| Jan. 13, 2019, 5:27 p.m. |
+ 2 |
for
Second Index-Kain12345
|
| Jan. 13, 2019, 5:27 p.m. |
+ 1 |
for
First-vit.aborigen
|
| Jan. 13, 2019, 4:01 p.m. |
+ 3 |
for
 Stack-veky
|
| Jan. 8, 2019, 11:31 p.m. |
+ 3 |
for
 First-bukebuer
|
| Jan. 5, 2019, 1:55 p.m. |
+ 2 |
for
 |—O—|-vmiimu
|
| Jan. 5, 2019, 1:55 p.m. |
+ 1 |
for
Second-ArchTauruS
|
| Jan. 5, 2019, 1:55 p.m. |
+ 1 |
for
One line. Tuple()-alekseykonotop
|
| Jan. 5, 2019, 1:55 p.m. |
+ 1 |
for
First-beiguanzhe
|
| Jan. 5, 2019, 1:54 p.m. |
+ 1 |
for
one-liner-danielattiach
|
| Jan. 4, 2019, 9:41 p.m. |
+ 1 |
for Comment
rsrg: Effective solution. Note that you could iterate over the items in "data" themselves, rather then ove...
|
