May 22, 2022, 7:20 p.m. |
+ 1 |
for Comment
Selindian: I like your solution. Thank you for showing me this library. :-)
|
June 22, 2021, 1:21 p.m. |
+ 1 |
for Comment
_Chico__5d82cee4f5234e78a5c65e: Noice!
|
May 26, 2021, 2:30 p.m. |
+ 1 |
for Comment
sleepgoose: can anyone explain what is wrap()? I never knew. sorry
|
May 26, 2021, 2:28 p.m. |
+ 1 |
for Comment
bermu875: Super helpful!Thanks a lot, a clear and eficient solution
|
April 27, 2021, 3:45 p.m. |
+ 1 |
for Comment
Tylerflx: learned something new
|
Feb. 9, 2021, 1:35 p.m. |
+ 1 |
for Comment
StephD: I didn't know that's library, thanks
|
Feb. 9, 2021, 1:35 p.m. |
+ 1 |
for Comment
hyewonkim: It's great!
|
Dec. 11, 2020, 5:14 p.m. |
+ 1 |
for Comment
r_tchaik: Short and clear!
|
Aug. 18, 2020, 9:10 a.m. |
+ 2 |
for
First-B_dur
|
Aug. 18, 2020, 9:10 a.m. |
+ 3 |
for
First-Sarina
|
Aug. 18, 2020, 9:10 a.m. |
+ 3 |
for
First-Jaime
|
July 8, 2020, 2:51 p.m. |
+ 1 |
for Comment
the-tranquility: Great solution!
|
July 8, 2020, 2:50 p.m. |
+ 1 |
for Comment
kudinov.feodor: I think this solution should be in top )) No need to invent a wheel if it is in common library
|
May 4, 2020, 9:44 a.m. |
+ 1 |
for Comment
max-belichenko: Simple & clear.
|
April 2, 2020, 5:49 p.m. |
+ 1 |
for Comment
Rcp8jzd: It's not the best, because you potentially store an enormous amount of data. But we can understand i...
|
March 23, 2020, noon |
+ 2 |
for
First-mortonfox
|
March 23, 2020, 11:59 a.m. |
+ 2 |
for
re_caps-Tical_1000
|
March 23, 2020, 11:59 a.m. |
+ 2 |
for
First-rodka81
|
March 23, 2020, 11:58 a.m. |
+ 3 |
for
try ... except-David_Jones
|
March 23, 2020, 11:58 a.m. |
+ 2 |
for
Third-colinmcnicholl
|
March 23, 2020, 11:58 a.m. |
+ 2 |
for
Cool n Clear-assargin
|
March 7, 2020, 5:39 a.m. |
+ 1 |
for Comment
hwdyhewhdh: Good use of recursion
|
Dec. 10, 2019, 4:56 p.m. |
+ 1 |
for Comment
9maksim: Good.
|
Sept. 28, 2019, 8:30 p.m. |
+ 1 |
for Comment
LintuStorm_a8334ed4883e45b9980: good
|
Sept. 5, 2019, 7:18 a.m. |
+ 2 |
for
First, fully documented, great mission-Ylliw
|
Sept. 1, 2019, 5:57 p.m. |
+ 2 |
for
Jarvis march-suic
|
Sept. 1, 2019, 5:57 p.m. |
+ 2 |
for
First-tom-tom_f993b3abc4814d4cb5476e
|
Sept. 1, 2019, 5:56 p.m. |
+ 2 |
for
First-eugene100372
|
Aug. 2, 2019, 7:15 p.m. |
+ 2 |
for
Elementary- Right to Left-tutek1
|
Aug. 2, 2019, 7:15 p.m. |
+ 2 |
for
Right to Left-PaulusWeb
|
Aug. 2, 2019, 7:15 p.m. |
+ 2 |
for
First-masamish
|
June 25, 2019, 2:27 p.m. |
+ 1 |
for Comment
ecarloshanson: I've never played with numpy or textwrap. I'll have to check them out.
|
June 14, 2019, 10:03 a.m. |
+ 1 |
for Comment
Ilis: I've knew some more about sorting (with cmp_to_key function).
|
June 13, 2019, 7:27 p.m. |
+ 2 |
for
First-mrflamm87
|
June 13, 2019, 7:27 p.m. |
+ 3 |
for
recursive-rafal.pawlowski
|
June 13, 2019, 7:27 p.m. |
+ 2 |
for
First-brainbrianfct
|
June 1, 2019, 8:21 a.m. |
+ 2 |
for
datetime is awesome-Denis_Gerashchenko
|
June 1, 2019, 8:21 a.m. |
+ 2 |
for
Days Between-Hilko
|
June 1, 2019, 8:21 a.m. |
+ 2 |
for
days diff has solved-Omarbd
|
June 1, 2019, 8:19 a.m. |
+ 1 |
for Comment
V.Shkaberda: I messed up with `start_point`, so I stole yours :)
|
May 25, 2019, 7:57 p.m. |
+ 2 |
for
First-aya.kanazawa
|
May 25, 2019, 7:57 p.m. |
+ 2 |
for
even better-Wienands
|
May 25, 2019, 7:57 p.m. |
+ 2 |
for
First-tomo_a
|
May 13, 2019, 9:18 a.m. |
+ 1 |
for Comment
rodka81: Nice
|
April 29, 2019, 1:04 p.m. |
+ 1 |
for Comment
vit.aborigen: Cheat! Just kidding - great tool for the great solution
|
April 17, 2019, 10:22 p.m. |
+ 1 |
for Comment
rodka81: Thanks for sharing this! I was not aware of this module in the scipy library.
|
April 12, 2019, 10:20 a.m. |
+ 1 |
for Comment
Plorchat: smart, using the groupby. Congrats!
|
April 6, 2019, 5:16 p.m. |
+ 1 |
for Comment
colinmcnicholl: Compact yet clear. It is much slower than a non numpy approach. 3 repeats, each 1000 times on assert...
|
Feb. 28, 2019, 6:05 p.m. |
+ 2 |
for
First-mukulsrawat1986_dbf8b7fdfbde4f
|
Feb. 28, 2019, 6:05 p.m. |
+ 2 |
for
.isupper()-sergegusev01
|
Feb. 28, 2019, 6:04 p.m. |
+ 2 |
for
Secret Message-Vladbka
|
Feb. 21, 2019, 7:40 a.m. |
+ 2 |
for
First-nashimo
|
Feb. 21, 2019, 7:40 a.m. |
+ 3 |
for
First-arbores401
|
Feb. 21, 2019, 7:40 a.m. |
+ 3 |
for
First-takaki_1nj3ct0r
|
Feb. 20, 2019, 7:27 p.m. |
+ 1 |
for Comment
quarkov: Try "}}}()" case. This solution won't go through.
|
Feb. 16, 2019, 6:49 p.m. |
+ 1 |
for Task
Inertia
|
Feb. 12, 2019, 5:44 a.m. |
+ 1 |
for Comment
cactusson: Your solution looks similar to mine. For some reason I made an else-block for the stuff you have in ...
|
Feb. 5, 2019, 6:08 p.m. |
+ 1 |
for Comment
Phil15: Thanks for the use of scipy, I should look at it more carefully, great algorithms are in this `scipy...
|
Jan. 15, 2019, 3:15 a.m. |
+ 2 |
for
First-Jaime
|
Jan. 15, 2019, 3:15 a.m. |
+ 3 |
for
First-Askanio234
|
Jan. 15, 2019, 3:15 a.m. |
+ 2 |
for
Fifth-ojisan
|
Jan. 1, 2019, 7:52 a.m. |
+ 2 |
for
First-Phil15
|
Jan. 1, 2019, 7:50 a.m. |
+ 2 |
for
First-cs1g
|
Jan. 1, 2019, 7:50 a.m. |
+ 2 |
for
First-jcg
|
Dec. 15, 2018, 12:37 p.m. |
+ 1 |
for Comment
colinmcnicholl: Nice code. You could have avoided the nasty looking indices with the following: return chain.from_it...
|
Dec. 8, 2018, 10:08 a.m. |
+ 1 |
for Comment
Phil15: I totally understand since it's your first yield thing. I use `yield` much more than `yield from` bu...
|
Dec. 8, 2018, 7:43 a.m. |
+ 1 |
for Comment
BrianMcleod: That's what the standard library is for!!
|
Dec. 8, 2018, 7:34 a.m. |
+ 1 |
for Comment
Phil15: Like it!! Probably because it's nearly mine and I already like it. Three comments * Good name `stack...
|
Dec. 4, 2018, 6:51 p.m. |
+ 2 |
for
First-Sillte
|
Dec. 4, 2018, 6:51 p.m. |
+ 1 |
for
detect then change-BrianMcleod
|
Dec. 4, 2018, 6:51 p.m. |
+ 1 |
for
TemporaryIndexation-Kouri
|
Dec. 3, 2018, 5:28 p.m. |
+ 1 |
for Comment
colinmcnicholl: You did well to have the patience to read and understand the long description for this mission. Line...
|
Nov. 30, 2018, 3:23 p.m. |
+ 1 |
for
10-liner: nice and clean-przemyslaw.daniel
|
Nov. 30, 2018, 3:23 p.m. |
+ 1 |
for
union set of intervals, zip for union, enumerate(op, 1)-Phil15
|
Nov. 30, 2018, 3:23 p.m. |
+ 1 |
for
First-rodka81
|
Nov. 19, 2018, 2:08 p.m. |
+ 2 |
for
First-technick303
|
Nov. 19, 2018, 2:08 p.m. |
+ 2 |
for
State solution-pseudorandomcoder
|
Nov. 19, 2018, 2:08 p.m. |
+ 2 |
for
Lamp OOP-Il_ja_Harchenko
|
Nov. 16, 2018, 8:46 a.m. |
+ 1 |
for Comment
vit.aborigen: Nice and clear
|
Nov. 9, 2018, 6:18 p.m. |
+ 2 |
for
First-popomin
|
Nov. 9, 2018, 6:17 p.m. |
+ 2 |
for
First-Merzix
|
Nov. 9, 2018, 6:17 p.m. |
+ 2 |
for
First-Molot
|
Nov. 3, 2018, 9:25 p.m. |
+ 3 |
for
min(routes generator, key=len)-Phil15
|
Oct. 28, 2018, 5:15 p.m. |
+ 1 |
for
First-pavel.borisofff
|
Oct. 26, 2018, 3:26 p.m. |
+ 2 |
for
First-comet.l
|
Oct. 26, 2018, 3:25 p.m. |
+ 2 |
for
7 lines & no imports-1-more
|
Oct. 26, 2018, 3:25 p.m. |
+ 1 |
for
Level 20 - Recursive Permutations-Infini7y
|
Oct. 2, 2018, 7:20 a.m. |
+ 1 |
for Comment
Phil15: A little improvement on the end: return any(fill(row, col, '') for row in range(len(grid)) for col i...
|
Sept. 28, 2018, 9:10 a.m. |
+ 1 |
for
12-liner: stack it up-przemyslaw.daniel
|
Sept. 26, 2018, 12:41 p.m. |
+ 1 |
for
scipy linprog-Sim0000
|
Sept. 26, 2018, 12:40 p.m. |
+ 1 |
for
Linear Programming-drpepper1412
|
Sept. 23, 2018, 10:27 a.m. |
+ 1 |
for
Second-Sillte
|
Sept. 23, 2018, 10:27 a.m. |
+ 1 |
for
Horizontal tree exploration with a max constraint on the pace of solution-Kouri
|
Sept. 23, 2018, 10:27 a.m. |
+ 1 |
for
heapq, stacks memory, only 10 02 12 21 (not really good but it works)-Phil15
|
Sept. 19, 2018, 2:24 p.m. |
+ 1 |
for Task
The Stones
|
Sept. 17, 2018, 2:41 p.m. |
+ 2 |
for
scipy.ndimage.find_objects-flpo
|
Sept. 16, 2018, 12:07 p.m. |
+ 1 |
for
Simple recursion-martin_b
|
Sept. 16, 2018, 12:07 p.m. |
+ 1 |
for
13-liner: by stack-przemyslaw.daniel
|
Sept. 16, 2018, 12:07 p.m. |
+ 1 |
for
deque-Sim0000
|
Sept. 12, 2018, 6:39 p.m. |
+ 1 |
for Comment
varnell-holdings: is_stressful('I am helplessly in love with you.') returns True. Appending whitespace to ch and then ...
|