May 11, 2015, 4:26 p.m. |
+ 1 |
for
First-tablestart
|
May 11, 2015, 4:24 p.m. |
+ 1 |
for
First-Jemmity
|
May 11, 2015, 4:16 p.m. |
+ 2 |
for
Using Regular Expressions-BirrellWalsh
|
May 11, 2015, 3:57 p.m. |
+ 1 |
for Comment
melpon: Thank you! "lambda" is very convenient when writing short code.
|
May 11, 2015, 3:56 p.m. |
+ 1 |
for Comment
contrebasse: if l % 2 == 1: For clarity, I would keep the ==1 here (or rather have !=0 actually).
|
May 11, 2015, 3:56 p.m. |
+ 2 |
for
First-Bilou06
|
May 11, 2015, 3:54 p.m. |
+ 2 |
for
sneaky offset-Renelvon
|
May 11, 2015, 3:53 p.m. |
+ 2 |
for
First-AndriusMk
|
May 11, 2015, 3:52 p.m. |
+ 2 |
for
Clear data.sort()-charleslee
|
May 11, 2015, 3:52 p.m. |
+ 2 |
for
First-sake12
|
May 11, 2015, 3:51 p.m. |
+ 2 |
for
Median-miro-blakeley
|
May 10, 2015, 11:10 a.m. |
+ 1 |
for Comment
veky: The most amazing thing is that someone dared to consider it _too long_. :-DD
|
May 10, 2015, 11:10 a.m. |
+ 1 |
for Comment
veky: What? :-) It's a list comprehension. Just read it, you'll probably understand. :-)
|
May 10, 2015, 11:09 a.m. |
+ 1 |
for Comment
abesto: Are you sure this is O(n)? d.count(x) counts the number of times x occurs in d for each element of d...
|
May 10, 2015, 11:07 a.m. |
+ 1 |
for Comment
nickie: If you go a few more questions along this road, what is Python?
|
May 10, 2015, 11:06 a.m. |
+ 1 |
for
Clear-radekj
|
May 10, 2015, 11:06 a.m. |
+ 1 |
for
First-alekzvik
|
May 10, 2015, 11:06 a.m. |
+ 1 |
for
First-maximusderango
|
May 10, 2015, 11:05 a.m. |
+ 1 |
for
oneLiner-donBit
|
May 10, 2015, 11:05 a.m. |
+ 1 |
for
First-AnnaCho
|
May 10, 2015, 11:04 a.m. |
+ 1 |
for Comment
deadbeef: I see no difference, top-1 and top-2 solutions are completely same.
|
May 10, 2015, 11:04 a.m. |
+ 2 |
for
eiji-eiji
|
May 10, 2015, 11:04 a.m. |
+ 2 |
for
~Shortest-veky
|
May 10, 2015, 11:03 a.m. |
+ 1 |
for
List comprehension-stclair.daniel_f70a54fff4764c4
|
May 10, 2015, 11:03 a.m. |
+ 2 |
for
First-davidjdv
|
May 10, 2015, 11:03 a.m. |
+ 2 |
for
First-valericus
|
May 8, 2015, 3 p.m. |
+ 1 |
for Comment
Alexandr_Svirbutovich: Thanks for this solution. Many useful things I have learned.
|
May 8, 2015, 2:58 p.m. |
+ 1 |
for Task
Friends
|
May 8, 2015, 2:57 p.m. |
+ 2 |
for
Second-dagger126
|
May 8, 2015, 2:56 p.m. |
+ 2 |
for
set-gyahun_dash
|
May 8, 2015, 11:02 a.m. |
+ 1 |
for Comment
gyahun_dash: I used [Format String](https://docs.python.org/3/library/string.html#format-examples). 0 in {} means...
|
May 8, 2015, 11:01 a.m. |
+ 2 |
for
Dry implementation-maurice.makaay
|
May 8, 2015, 10:58 a.m. |
+ 2 |
for
Second-gyahun_dash
|
May 8, 2015, 10:58 a.m. |
+ 2 |
for
First-gyahun_dash
|
May 8, 2015, 10:57 a.m. |
+ 2 |
for
First-Sim0000
|
May 8, 2015, 10:57 a.m. |
+ 1 |
for Comment
DiZ: Kudos for documentation!
|
May 8, 2015, 10:33 a.m. |
+ 1 |
for
"Verify Anagrams" Review
|
May 8, 2015, 10:28 a.m. |
+ 2 |
for
lambda-mseugen
|
May 8, 2015, 10:27 a.m. |
+ 1 |
for Comment
Cjkjvfnby: It is best way to do it both in execution speed and readability.
|
May 8, 2015, 10:27 a.m. |
+ 2 |
for
simple-Cjkjvfnby
|
May 8, 2015, 10:27 a.m. |
+ 2 |
for
Hinted-veky
|
May 8, 2015, 10:27 a.m. |
+ 1 |
for Comment
artemrudenko: Magic is always around us
|
May 8, 2015, 10:26 a.m. |
+ 1 |
for Comment
Cjkjvfnby: Simple is better than complex.
|
May 8, 2015, 10:26 a.m. |
+ 1 |
for Comment
Amachua: Python 3.x way :) P.S. Why use tuple here? It works fine without it :)
|
May 8, 2015, 10:21 a.m. |
+ 1 |
for Comment
bryukh: Simple and accurate.
|
May 8, 2015, 10:21 a.m. |
+ 2 |
for
intersection-Cjkjvfnby
|
May 8, 2015, 10:20 a.m. |
+ 2 |
for
First-ryosms
|
May 8, 2015, 10:20 a.m. |
+ 1 |
for Comment
Cjkjvfnby: **set(...) & set(...)** has same effect as **set(...).intersection([...])** converting list to set i...
|
May 8, 2015, 10:19 a.m. |
+ 2 |
for
Intersection-bryukh
|
May 8, 2015, 9:55 a.m. |
+ 2 |
for
First-LLluma
|
May 8, 2015, 9:55 a.m. |
+ 1 |
for Comment
codeM0nk3y: This may be a *brilliant* solution, but it is not clear in the least.
|
May 8, 2015, 9:55 a.m. |
+ 1 |
for Comment
kamikaze: nice. but while you are trying to reduce line count you are violation PEP-8 and readability :)
|
May 8, 2015, 9:54 a.m. |
+ 1 |
for Comment
Cjkjvfnby: Exact as I expect.
|
May 8, 2015, 9:54 a.m. |
+ 2 |
for
First-ciel
|
May 8, 2015, 9:53 a.m. |
+ 1 |
for Task
Number Base
|
May 8, 2015, 9:15 a.m. |
+ 1 |
for Comment
veky: Nice idea, but please watch the video "stop writing classes". ;-]
|
May 8, 2015, 9:13 a.m. |
+ 1 |
for Comment
ArchTauruS: real love needs no reason, hehe
|
May 8, 2015, 9:13 a.m. |
+ 2 |
for
Clearly-gyahun_dash
|
May 8, 2015, 9:13 a.m. |
+ 2 |
for
Magnum opus-veky
|
May 8, 2015, 9:12 a.m. |
+ 2 |
for
First-Amachua
|
May 8, 2015, 9:11 a.m. |
+ 2 |
for
First-abe.dillon
|
May 8, 2015, 9:11 a.m. |
+ 2 |
for
Three Reasons I Love Python-timio
|
May 8, 2015, 8:53 a.m. |
+ 1 |
for Task
I Love Python!
|
May 8, 2015, 8:51 a.m. |
+ 1 |
for Comment
veky: This is very wrong. docstrings aren't meant to be used like that. They are the help to someone _usin...
|
May 8, 2015, 8:51 a.m. |
+ 2 |
for
First-monica
|
May 8, 2015, 8:51 a.m. |
+ 1 |
for Comment
monica: Thanks for commenting my solutions. I just started learning Python the other day and your posts are ...
|
May 8, 2015, 8:50 a.m. |
+ 1 |
for Comment
gatogordo: bin() already returns a string. The str() is not needed. Other than that, we did the same thing. :D
|
May 8, 2015, 8:50 a.m. |
+ 2 |
for
First-Gennady
|
May 8, 2015, 8:48 a.m. |
+ 1 |
for Task
Binary Count
|
May 8, 2015, 8:46 a.m. |
+ 1 |
for Task
Pangram
|
May 8, 2015, 8:44 a.m. |
+ 1 |
for
Subset-veky
|
May 8, 2015, 8:41 a.m. |
+ 1 |
for Comment
dagger126: This can rewrite set(a) <= set(b)
|
May 8, 2015, 8:39 a.m. |
+ 1 |
for
First-dagger126
|
May 8, 2015, 7:29 a.m. |
+ 1 |
for
simpler-mr.floppy
|
May 8, 2015, 7:29 a.m. |
+ 1 |
for
First-bukebuer
|
May 7, 2015, 4:59 p.m. |
+ 1 |
for
First-panaro32
|
May 7, 2015, 4:57 p.m. |
+ 1 |
for
Double loop-bryukh
|
May 7, 2015, 3:09 p.m. |
+ 1 |
for Comment
arma: Very original recursion solution. This technique is described here: [Extended Iterable Unpacking](ht...
|
May 7, 2015, 2:57 p.m. |
+ 1 |
for
recursion-Cjkjvfnby
|
May 7, 2015, 2:47 p.m. |
+ 1 |
for
Nested cycle-mike269
|
May 7, 2015, 2:47 p.m. |
+ 1 |
for Comment
Cjkjvfnby: You can use bool as int. # if x > y: count += 1 count += x > y
|
May 7, 2015, 2:46 p.m. |
+ 1 |
for
First-gyahun_dash
|
May 7, 2015, 2:45 p.m. |
+ 1 |
for
First-bukebuer
|
May 7, 2015, 1:47 p.m. |
+ 1 |
for
First-michael.kej
|
May 7, 2015, 1:46 p.m. |
+ 1 |
for Comment
Cjkjvfnby: Making own implementation for standard library functions is not clear. Using standard library functi...
|
May 7, 2015, 1:45 p.m. |
+ 1 |
for
reduce-Cjkjvfnby
|
May 7, 2015, 1:45 p.m. |
+ 1 |
for
Convert and Iterate-bryukh
|
May 5, 2015, 3:36 p.m. |
+ 1 |
for
First-bukebuer
|
May 5, 2015, 3:36 p.m. |
+ 1 |
for Comment
Cjkjvfnby: This is english speaking forum, please use english. Code style make code more readable. I leave comm...
|
May 5, 2015, 3:36 p.m. |
+ 1 |
for Comment
Cjkjvfnby: Some notes about style: no need parenthesis and you miss space after coma return ",".join(phrases).r...
|
May 5, 2015, 3:35 p.m. |
+ 1 |
for Comment
tarikki: Haha it's so simple with replace()! Man all those for loops were a pain in my solution :P
|
May 3, 2015, 10:36 a.m. |
+ 1 |
for
First-madmanbob
|
May 2, 2015, 6:35 p.m. |
+ 1 |
for
First-sake12
|
May 2, 2015, 6:33 p.m. |
+ 1 |
for Task
Three Words
|
May 2, 2015, 6:32 p.m. |
+ 1 |
for
for else-veky
|
May 2, 2015, 6:23 p.m. |
+ 1 |
for Task
Secret Message
|
May 2, 2015, 6:22 p.m. |
+ 1 |
for
filter-veky
|
May 2, 2015, 6:22 p.m. |
+ 1 |
for
First-gyahun_dash
|
May 2, 2015, 4 p.m. |
+ 1 |
for
__-Cjkjvfnby
|
May 2, 2015, 3:59 p.m. |
+ 1 |
for
First-Yean-Bon
|