May 15, 2018, 8:18 a.m. |
+ 4 |
for
First-Sim0000
|
May 9, 2018, 8:17 p.m. |
+ 1 |
for Comment
suic: Hi, the same on one line: ```python def first_word(text): return text.replace('.', ' ').replace(',',...
|
May 3, 2018, 11:02 a.m. |
+ 4 |
for
Fifth-tom-tom_f993b3abc4814d4cb5476e
|
May 1, 2018, 9:09 p.m. |
+ 4 |
for
str.index - ValueError-oduvan
|
May 1, 2018, 8:22 p.m. |
+ 4 |
for
Say Hi-svartmetall
|
May 1, 2018, 7:19 p.m. |
+ 4 |
for
First-tom-tom_f993b3abc4814d4cb5476e
|
April 29, 2018, 7:55 p.m. |
+ 2 |
for
First-Sim0000
|
Nov. 23, 2017, 1:45 p.m. |
+ 1 |
for Comment
hanpari: And what about: for y in str(number): product *= int(y) if y != "0" else 1
|
Nov. 23, 2017, 1:45 p.m. |
+ 1 |
for Comment
Daniel_Pereira: In the line 3, why not for y in str(number).replace('0', ''): ?
|
Nov. 23, 2017, 1:42 p.m. |
+ 1 |
for Comment
floord: There there. No need to use the words 'nonsense' or 'bloody'. :)
|
Nov. 23, 2017, 1:42 p.m. |
+ 1 |
for Comment
veky: For me, it's other way around: "why use def when you can use lambda?". :-]] Namely, you can use def ...
|
Nov. 23, 2017, 1:42 p.m. |
+ 1 |
for Comment
poik: nice!
|
Nov. 23, 2017, 1:40 p.m. |
+ 1 |
for Comment
PositronicLlama: I like the use of the 'min' function, but you could consider using the 'key' argument, which would e...
|
Nov. 23, 2017, 1:37 p.m. |
+ 1 |
for Comment
seandor: not pythonic.
|
Dec. 1, 2014, 10:53 a.m. |
+ 1 |
for Comment
veky: Unfortunately, almost all of them are Python2 focused. It is better than nothing (or Java:), but it ...
|
Dec. 1, 2014, 10:53 a.m. |
+ 1 |
for Comment
veky: It seems you're still in the "fascinated" phase (probably because you missed Perl:). There's nothing...
|
July 1, 2014, 2:03 p.m. |
+ 1 |
for Comment
Akay: You don't need use str() function
|
June 19, 2014, 11:03 p.m. |
+ 1 |
for Comment
bryukh: All mazes in the tests are solvable. The message "Player did not reach exit" exists for cases when u...
|
June 19, 2014, 5:56 p.m. |
+ 1 |
for Comment
pohmelie: Labyrinth is just 12x12, you will not reach recursion limit. My solution is recursive, and it's acce...
|
June 3, 2014, 6:11 p.m. |
+ 4 |
for
Using +-veky
|
June 3, 2014, 6:10 p.m. |
+ 1 |
for Comment
nickie: Nice hack.
|
June 3, 2014, 5:34 p.m. |
+ 2 |
for
First-Avaris
|
June 3, 2014, 4:28 p.m. |
+ 1 |
for Comment
veky: I don't see what's so funny in binary addition.
|
May 10, 2014, 4:18 p.m. |
+ 3 |
for
sorted-Cjkjvfnby
|
May 10, 2014, 3:27 p.m. |
+ 1 |
for Comment
macfreek: The code should read: max(filter(str.isalpha,"@v$e56r5CY{]")) Not: max(filter(str.isalpha,\"@v$e56r5...
|
May 1, 2014, 10:45 a.m. |
+ 1 |
for Comment
veky: Ah, ok then. I thought you teach C because you have that low-level mindset: int flags, while loops, ...
|
Feb. 27, 2014, 4:43 p.m. |
+ 1 |
for Post
Remove published solution
|
Feb. 27, 2014, 3:22 p.m. |
+ 2 |
for
Hinted-veky
|
Feb. 27, 2014, 2:44 p.m. |
+ 1 |
for
Feeding Pegions-shreekar
|
Feb. 27, 2014, 1:01 p.m. |
+ 1 |
for
The Key-bryukh
|
Feb. 27, 2014, 11:16 a.m. |
+ 1 |
for
Intersection-bryukh
|
Feb. 27, 2014, 10:31 a.m. |
+ 2 |
for
Double loop-bryukh
|
Feb. 27, 2014, 9:53 a.m. |
+ 3 |
for
for_If_If-pythonist
|
Feb. 26, 2014, 9:53 p.m. |
+ 1 |
for
Convert and Iterate-bryukh
|
Feb. 26, 2014, 6:05 p.m. |
+ 3 |
for
First-madmanbob
|
Feb. 26, 2014, 5:38 p.m. |
+ 3 |
for
W or D-bryukh
|
Feb. 26, 2014, 5:10 p.m. |
+ 2 |
for
First-monkshorin
|
Feb. 26, 2014, 4:58 p.m. |
+ 3 |
for
switch-case-bryukh
|
Feb. 26, 2014, 10:54 a.m. |
+ 3 |
for
First-MadHatter
|
Feb. 7, 2014, 8:51 a.m. |
+ 1 |
for Comment
veky: I completely agree with you. I would also like you to note the fact that I am not your employee. ;-)...
|
Nov. 22, 2013, 5:41 p.m. |
+ 1 |
for
First-pyDav_cf40f963757b44eb8deb4c26
|
Nov. 22, 2013, 2:23 p.m. |
+ 1 |
for
First-bryukh
|
Nov. 22, 2013, 2:22 p.m. |
+ 1 |
for Comment
BpLife: Hi,Are you Chinese?
|
Nov. 22, 2013, 2:22 p.m. |
+ 1 |
for Comment
PavloTaiko: Your kungfu is better then mine kungfu.
|
Nov. 22, 2013, 2:21 p.m. |
+ 1 |
for Comment
AntonPopov: return str(n) == str(n)[::-1] cool! I was wondering how to reverse strings concisely and here it is!
|
Nov. 22, 2013, 11:31 a.m. |
+ 2 |
for
First-mouettix
|
Nov. 22, 2013, 11:29 a.m. |
+ 1 |
for Comment
while0pass: Very beautiful, but how about words with trailing numbers? They are still get processed, though they...
|
Nov. 17, 2013, 1:51 p.m. |
+ 2 |
for
First-dougall
|
Nov. 14, 2013, 3:21 p.m. |
+ 1 |
for Comment
bryukh: It iterates through "lowercase" and count each letter in the text.
|
Nov. 14, 2013, 2:41 p.m. |
+ 1 |
for
Checks-Amachua
|
Nov. 13, 2013, 12:35 p.m. |
+ 2 |
for
One-line solution-gcolle
|
Nov. 13, 2013, 11:44 a.m. |
+ 1 |
for
First-pipan
|
Nov. 13, 2013, 9:19 a.m. |
+ 1 |
for Comment
veky: That's why I told you to see my solution. It has not that lambda. Lambda usually makes people unconf...
|
Nov. 13, 2013, 9:13 a.m. |
+ 1 |
for Comment
veky: Yes, but it will count them _in_ text.lower(). So it accomplishes what's written: > The letter retur...
|
Nov. 13, 2013, 2:56 a.m. |
+ 1 |
for Comment
fangtao: 牛逼
|
Nov. 13, 2013, 2:39 a.m. |
+ 2 |
for
First-Or123
|
Nov. 13, 2013, 2:17 a.m. |
+ 2 |
for
First-oduvan
|
Nov. 9, 2013, 10:18 p.m. |
+ 1 |
for
~Shortest-veky
|
Sept. 19, 2013, 12:05 p.m. |
+ 2 |
for
Thanks to PL-bryukh
|
Sept. 16, 2013, 9:44 a.m. |
+ 2 |
for
First-artemrudenko
|
July 30, 2013, 12:42 p.m. |
+ 1 |
for
Vector Fun!-lrekucki
|
July 23, 2013, 6:43 p.m. |
+ 1 |
for
First-oduvan
|
July 23, 2013, 8:46 a.m. |
+ 1 |
for
Second-oduvan
|
July 19, 2013, 1:14 p.m. |
+ 1 |
for
First-bryukh
|
July 19, 2013, 12:59 p.m. |
+ 1 |
for Comment
username724: for variant in combinations(batteries, combination_length): While I agree with your sentiment, I am ...
|
July 19, 2013, 12:53 p.m. |
+ 1 |
for Comment
bryukh: You can use combinations with different lenght. For example if you have list example = [2, 3, 5, 6] ...
|
July 15, 2013, 10:26 p.m. |
+ 1 |
for
First-old_user
|
July 13, 2013, 7:32 a.m. |
+ 1 |
for Comment
guido: This is a perfectly acceptable solution for passwords, which are typically not very long. I am going...
|