July 26, 2021, 5:29 p.m. |
+ 1 |
for Comment
ann3leo: I really like 'while-else' using here. Elegant!
|
May 25, 2021, 5:48 p.m. |
+ 1 |
for Comment
Calen: well, this is very educational!
|
Jan. 30, 2019, 3:33 p.m. |
+ 1 |
for Comment
vit.aborigen: This solution deserves to take 1st place
|
Dec. 19, 2018, 3:31 p.m. |
+ 1 |
for Comment
vit.aborigen: WoW! Never heard of the deque.rotate() method. Thanks!
|
Dec. 14, 2018, 7:41 p.m. |
+ 1 |
for Comment
mplichta: looks over complicated to me [check this out](https://py.checkio.org/mission/multicolored-lamp/publi...
|
Nov. 26, 2018, 6:10 p.m. |
+ 1 |
for Comment
BrianMcleod: Straight forward use of a library. That's what I love about Python!!
|
July 23, 2018, 6:03 p.m. |
+ 1 |
for Comment
PatinaHo: Thought of using recursion but couldn't make it as simple as that. This is great:)
|
May 31, 2018, 12:55 p.m. |
+ 1 |
for Comment
suic: Hi, not bad but a bit long :): ```python def checkio(x): return "".join(map(to_asc_char, x)) or x ``...
|
May 13, 2018, 5:41 p.m. |
+ 1 |
for Comment
suic: Hi, two comments: 1. You could "precompile" the regexes and used the compiled version in `re.search`...
|
Nov. 23, 2017, 1:45 p.m. |
+ 1 |
for Comment
guido: This is a perfectly acceptable solution for passwords, which are typically not very long. I am going...
|
Nov. 23, 2017, 1:42 p.m. |
+ 1 |
for Comment
Cjkjvfnby: Set -1 because **len(array) == 0** PEP8: For sequences, (strings, lists, tuples), use the fact that ...
|
Sept. 29, 2017, 5:11 a.m. |
+ 1 |
for Comment
mastak: Nice! But also, you can use **deque** instead of simple list (for res var).
|
July 22, 2017, 5:29 p.m. |
+ 1 |
for Comment
Freiling: Minor note, couldn't line 6 be: if c in ("({["): ?
|
Jan. 26, 2017, 8:27 p.m. |
+ 1 |
for Comment
veky: Everything works well untill that monstrous return. Yes, Python doesn't have switch statement, and i...
|
Dec. 10, 2016, 2:55 p.m. |
+ 1 |
for Comment
DerryK: Nice use of sentinel at the bottom of the stack. A very minor suggestion: You could replace the last...
|
Aug. 22, 2016, 6:06 p.m. |
+ 1 |
for Comment
han97: Creating a dict to check coordinates being in bounds? Isn't it faster to just check coordinates? lik...
|
Feb. 3, 2016, 5:14 a.m. |
+ 1 |
for Comment
ludek.reif: Nice solution, I like 'item[-2]' test.
|
Nov. 18, 2015, 11:42 a.m. |
+ 1 |
for Comment
veky: The whole point of // is that you can ignore the remainder. So you don't need -1 in line 5. :-) And ...
|
Nov. 16, 2015, 5:23 a.m. |
+ 1 |
for Comment
rojeeer: This idea is really really impressive. At first glance, I have no idea of the algorithm, until I not...
|
Sept. 3, 2015, 5:40 p.m. |
+ 1 |
for Comment
PyPoet: That's cool and I do believe that it's actually speedy. I like how you exploit the 'last in - first ...
|
Aug. 23, 2015, 5:28 p.m. |
+ 1 |
for Comment
Waanie_5ba01babafae48b3adbf8c0: Nice solution! I like it that you don't change the string itself, but just build a new one in the en...
|
April 13, 2015, 5:20 p.m. |
+ 1 |
for Comment
suic: Nice, but I would shorten _eq_ a bit: eq = lambda w: sorted(filter(str.isalpha, w.lower()))
|
April 13, 2015, 5:18 p.m. |
+ 1 |
for Comment
suic: Hi, why not _filter()_?: "".join(filter(str.isupper, message))
|
April 1, 2015, 11:14 a.m. |
+ 1 |
for Comment
guido: I had a hard time deciding on the vote. On the plus side, this is a fairly complex algorithm and the...
|
April 1, 2015, 11:09 a.m. |
+ 1 |
for Comment
veky: Nice usage of time module. conv_dict could be much less repetitive if you looked up things like this...
|
April 1, 2015, 11:09 a.m. |
+ 1 |
for Comment
guido: Cool solution! Very clever use of str.split() and a strict interpretation of the input format descri...
|
March 18, 2015, 2:50 p.m. |
+ 1 |
for Comment
Japijapo: Suic thank you for your comment! I am new to this language and your comment is helpfull
|
March 12, 2015, 9:27 p.m. |
+ 1 |
for Comment
veky: Nice idea, but please watch the video "stop writing classes". ;-]
|
March 12, 2015, 8:26 p.m. |
+ 1 |
for Comment
veky: frozenset is much simpler than tuple of sorted, since there are no repetitions. itertools.chain is a...
|
Feb. 4, 2015, 7:26 p.m. |
+ 1 |
for Comment
veky: Since so many people here adore your solution, I won't spend too much words about how beautiful it i...
|
Feb. 3, 2015, 4:23 p.m. |
+ 1 |
for Comment
veky: Congratulations on your first published solution. :-) Now learn about _real_ ways of iterating throu...
|
Dec. 31, 2014, 7:11 p.m. |
+ 1 |
for Comment
xtofl: Quite a find, to represent the sparse matrix as a series of living-cell-coordinates. It matches the ...
|
Dec. 27, 2014, 6:09 p.m. |
+ 1 |
for Comment
xtofl: Smart, to work with the `scope` intermediary. Smart trick to filter for `x or y`. On the other hand,...
|
Dec. 6, 2014, 8:53 a.m. |
+ 1 |
for Comment
veky: This is a nice example of how chaining can help you write better code. First, x == 1 and y == 1 can ...
|
Dec. 2, 2014, 3:45 p.m. |
+ 1 |
for Comment
Fedorovich: Something new what I see befor. Cool
|
Dec. 2, 2014, 5:43 a.m. |
+ 1 |
for Comment
veky: Line 12 is unnecessary. Much better is to inline it. Naming something "count" is in no way clearer t...
|
Dec. 1, 2014, 8:52 p.m. |
+ 1 |
for Comment
veky: I know you're proud of this solution (I read your blog;), but your operators are a bit convoluted, y...
|
Dec. 1, 2014, 8:52 p.m. |
+ 1 |
for Comment
bryukh: You don't need line 2. Just `def checkio(number):` if you don't like 'data' name.
|
Nov. 27, 2014, 3:05 p.m. |
+ 1 |
for Comment
LLluma: eq = lambda w: sorted(w.lower().replace(' ', ''))
|
Nov. 3, 2014, 4:18 p.m. |
+ 1 |
for Comment
cellsuicide: The fact that it is so unnecessarily complex makes it unclear.
|
Sept. 22, 2014, 3:07 p.m. |
+ 1 |
for Comment
artemrudenko: Cool, small tips: for x in range(0,8): No need to specify 0 in range, e.g. can be replaced with: for...
|
Sept. 6, 2014, 9:26 a.m. |
+ 1 |
for Comment
taras-sereda: For understanding. Is it more efficient to have several IFs instead of one IF with a bunch of ELIFs?
|
Sept. 4, 2014, 10:09 a.m. |
+ 1 |
for Comment
pohmelie: "exclusive": lambda x,y: (x or y) and not (x and y) It's just "exclusive": lambda x,y: x ^ y
|
Aug. 29, 2014, 6:32 p.m. |
+ 1 |
for Comment
artemrudenko: Just a hint - you can use '{:b}'.format(n) to get the same as bin(n)[2:]
|
Aug. 27, 2014, 1:54 p.m. |
+ 1 |
for Comment
rbrian: Hi Hanpari many thanks for the review! I see your point on lines two and three. When I was reviewing...
|
Aug. 27, 2014, 1:52 p.m. |
+ 1 |
for Comment
rbrian: Hi thanks for again for the review. Yeah, I noted that point after I had read other's solutions. I d...
|
Aug. 17, 2014, 8:19 p.m. |
+ 1 |
for Comment
Cjkjvfnby: **str** is bad name for variable you can use **in** instead of **find**
|
Aug. 1, 2014, 5:10 p.m. |
+ 1 |
for Comment
Cjkjvfnby: You can get alphabet : **from string import ascii_lowercase** No need to c.lower() it is already in ...
|
July 13, 2014, 10:19 a.m. |
+ 1 |
for Comment
bryukh: You forgot about spaces around operators (pep8). if cell[0]==10 and cell[1]==10: You can make it sim...
|
July 13, 2014, 8:53 a.m. |
+ 1 |
for Comment
Cjkjvfnby: **map** and **min** are builtin functions, it is bad practice to shadow them. Code in lines 19-34 ca...
|
April 26, 2014, 8:20 a.m. |
+ 1 |
for Comment
lesenv: i thought this algorithm was quite nice. after having read guidos post i'm feeling kind of stupid as...
|