April 24, 2024, 5:07 p.m. |
+ 1 |
for Comment
Bob13: good
|
April 18, 2024, 4:36 p.m. |
+ 1 |
for Comment
tamagoyaki: Thank you U.V. I will use it!
|
April 18, 2024, 4:36 p.m. |
+ 1 |
for Comment
U.V: "abcdefghijklmnopqrstuvwxyz"+"abcdefghijklmnopqrstuvwxyz" contains in string package **from string i...
|
April 18, 2024, 4:35 p.m. |
+ 1 |
for Comment
walmas: ooh didn't know about these, nice..
|
April 1, 2024, 3:57 p.m. |
+ 1 |
for Comment
kdim: I think it'be easier. In your code you can use XOR operation. bool() != bool() is XOR operation for ...
|
April 1, 2024, 3:57 p.m. |
+ 1 |
for Comment
kdim: not any == all
|
March 30, 2024, 9:33 a.m. |
+ 1 |
for Comment
kdim: Great! Good luck!
|
March 30, 2024, 9:33 a.m. |
+ 1 |
for Comment
kdim: Let yourself use them!
|
March 30, 2024, 9:24 a.m. |
+ 1 |
for Comment
kdim: if num == 0 then we return 1 - one zero, if 0 < num < 10 then we return 0 - no zero, if num>=10 then...
|
March 30, 2024, 9:24 a.m. |
+ 1 |
for Comment
kdim: Thanks!
|
March 30, 2024, 8:12 a.m. |
+ 1 |
for Comment
kdim: len(items) // 2 + 1 if len(items) % 2 != 0 else len(items) // 2 you can change to len(items) // 2 + ...
|
March 25, 2024, 5:44 p.m. |
+ 1 |
for Comment
StefanPochmann: But with `finditer` and `+=`, you’re using very little memory, much less memory than `join` would. M...
|
March 24, 2024, 4:50 p.m. |
+ 1 |
for Comment
tamagoyaki: I just modified Zeller's congruence into Python. https://en.wikipedia.org/wiki/Zeller%27s_congruence...
|
March 24, 2024, 4:50 p.m. |
+ 1 |
for Comment
kdim: difficult to understand
|
March 24, 2024, 4:50 p.m. |
+ 1 |
for Comment
kdim: O! Thank you! I didn't know about this algorithm. Is it clear now!
|
March 24, 2024, 4:49 p.m. |
+ 1 |
for Comment
kdim: Nice solution!
|
March 24, 2024, 4:49 p.m. |
+ 1 |
for Comment
kdim: Good!
|
March 24, 2024, 4:48 p.m. |
+ 1 |
for Comment
kdim: Clever solution!
|
March 24, 2024, 3:26 p.m. |
+ 1 |
for Comment
kdim: Perfect!
|
March 24, 2024, 3:25 p.m. |
+ 1 |
for Comment
kdim: Suitable place to use **yield** def find_divisors(n): for i in range(1, n): if n % i == 0: yield i
|
March 24, 2024, 3:23 p.m. |
+ 1 |
for Comment
kdim: Good use of RE. Why didn't you use ''.join()?
|
March 21, 2024, 5:16 p.m. |
+ 1 |
for Comment
kdim: interesting solution
|
Feb. 21, 2024, 6:06 p.m. |
+ 1 |
for Comment
veky: I'm glad you like them. :)
|
Jan. 16, 2024, 5:46 p.m. |
+ 1 |
for Comment
vtflnk: This is not a bad solution. Some people use sets. This is unreasonably difficult. So if you were to ...
|
Jan. 5, 2024, 5:07 p.m. |
+ 1 |
for Comment
tramcrazy: Exactly what I did! Well done, this seems to be the easiest way to do it with the Python default lib...
|
Dec. 25, 2023, 7:33 a.m. |
+ 1 |
for Comment
alamin0489: clear
|
Nov. 28, 2023, 6:03 a.m. |
+ 1 |
for Comment
mlahor: A good solution
|
Nov. 25, 2023, 4:34 p.m. |
+ 1 |
for Comment
sergray: Clear bruteforce solution. Might be only good to mention time and space complexity in the comment.
|
Nov. 16, 2023, 4:54 p.m. |
+ 1 |
for Comment
Kolia951: Agree with other comments! Very nice and pythonic solution.
|
Nov. 14, 2023, 6:35 p.m. |
+ 1 |
for Comment
mlahor: ChatGPT This provided solution uses regular expressions (regex) to find the length of the longest su...
|
Nov. 3, 2023, 6:08 p.m. |
+ 1 |
for Comment
veky: yield is just an artefact of the solving system. Groupby is the real hero here. :-)
|
Nov. 3, 2023, 6:07 p.m. |
+ 1 |
for Comment
veky: > Why is it not faster to use a list comprehension than a generator function? I think I explained th...
|
Nov. 3, 2023, 6:07 p.m. |
+ 1 |
for Comment
veky: You can learn about these things either through reading the Python stdlib documentation, or reading ...
|
Nov. 3, 2023, 6:03 p.m. |
+ 1 |
for Comment
tamagoyaki: "sympy" and "perfect_power"! incredible solution!
|
Nov. 3, 2023, 6:02 p.m. |
+ 1 |
for Comment
tamagoyaki: Great Speedy! I think using an assignment expression will speed things up a bit.
|
Nov. 3, 2023, 6:01 p.m. |
+ 1 |
for Comment
tamagoyaki: while len(ugly_list) < n*5: this "max count" is correct. Isn't the idea of using "pop(0)" instead ...
|
Nov. 3, 2023, 5:59 p.m. |
+ 1 |
for Comment
tamagoyaki: It's a fast and good solution
|
Nov. 3, 2023, 5:58 p.m. |
+ 1 |
for Comment
veky: It's just an integer dyadic logarithm.
|
Nov. 3, 2023, 5:58 p.m. |
+ 1 |
for Comment
veky: First sentence: great, and exactly the reason why I'm writing them this way. Second sentence: I'm tr...
|
Nov. 3, 2023, 5:57 p.m. |
+ 1 |
for Comment
veky: Here is the discussion: https://py.checkio.org/forum/post/12583/meaningful-missions/#comment-63213
|
Nov. 3, 2023, 5:56 p.m. |
+ 1 |
for Comment
veky: You don't have to... just let me use the whole Python, not bite-sized chunks of it. :-P Ah, so this ...
|
Nov. 3, 2023, 5:55 p.m. |
+ 1 |
for Comment
tamagoyaki: It's amazing how well you're using third-party solutions.
|
Nov. 3, 2023, 5:54 p.m. |
+ 1 |
for Comment
tamagoyaki: Genius solution! I like this!
|
Nov. 3, 2023, 5:54 p.m. |
+ 1 |
for Comment
tamagoyaki: At first I thought this code would make a calculation mistake, but this code is correct.
|
Oct. 29, 2023, 7:36 p.m. |
+ 1 |
for Comment
kdim: "(op, *key), value in data" - cool! Your solution looks good!
|
Oct. 28, 2023, 9:13 p.m. |
+ 1 |
for Comment
veky: > Yep, and it’s better not to say what browser I’m still using. :) Netscape?! :-DD
|
Oct. 28, 2023, 9:13 p.m. |
+ 1 |
for Comment
veky: Thank you. I'm glad I could help you with mental gymnastics. :-)
|
Oct. 28, 2023, 9:13 p.m. |
+ 1 |
for Comment
veky: Since you didn't give me a thumb, I'll assume that was sarcasm. :-] Yes, hardcoding positions of all...
|
Oct. 28, 2023, 9:12 p.m. |
+ 1 |
for Comment
veky: The only important thing is: do you _want_ to understand? If yes, and you are willing to invest some...
|
Oct. 20, 2023, 3:24 p.m. |
+ 1 |
for Comment
kisungch: Thanks!
|
Sept. 12, 2023, 4:03 p.m. |
+ 1 |
for Comment
Pavellver: Nice solution! Very good usage of string methods!
|
Sept. 6, 2023, 3 p.m. |
+ 1 |
for Comment
joe_5588: Interesting list comprehension, and I hadn't seen repeat before.
|
Aug. 29, 2023, 6:54 p.m. |
+ 1 |
for Comment
TheRing: Nice idea to use init functions with keyword arguments and default values.
|
Aug. 28, 2023, 5:05 p.m. |
+ 1 |
for Comment
kudinov.feodor: you ll have troubles if there are more than 1k stones
|
Aug. 24, 2023, 6:49 p.m. |
+ 1 |
for Comment
BootzenKatzen: Making this look easy! Short and to the point! I didn't know about istitle(), so thanks for that!
|
Aug. 17, 2023, 6:22 a.m. |
+ 1 |
for Comment
Pavellver: A great solution! Everything is clear, and, most importantly, the solution is short and clear!
|
Aug. 15, 2023, 4:10 p.m. |
+ 1 |
for Comment
TheRing: Not the most simple solution, but very readable.
|
Aug. 15, 2023, 12:27 p.m. |
+ 1 |
for Comment
kudinov.feodor: pattern = re.sub('\[\]', '[^.]', pattern) good catch, in my solution if I find [] I return False at ...
|
July 10, 2023, 5:22 a.m. |
+ 1 |
for Comment
flowerinapot: Good!
|
July 10, 2023, 5:22 a.m. |
+ 1 |
for Comment
flowerinapot: Clear
|
July 3, 2023, 5:04 p.m. |
+ 1 |
for Comment
flowerinapot: Nice solution with recursion, but it's probably more creative :)
|
June 21, 2023, 5 p.m. |
+ 1 |
for Comment
Nocturne13: Great.
|
June 5, 2023, 5:48 a.m. |
+ 1 |
for Comment
Nocturne13: , nice and clear solution of this task, well done!
|
May 31, 2023, 3:12 p.m. |
+ 1 |
for Comment
Oleg_Levonjuk: Very thoroughly documented. 8-) Nice!
|
May 29, 2023, 7:44 p.m. |
+ 1 |
for Comment
Pavellver: Clear and concise!
|
May 25, 2023, 5:03 p.m. |
+ 1 |
for Comment
Pavellver: Nice solution!
|
May 22, 2023, 6:32 p.m. |
+ 1 |
for Comment
Pavellver: Good implementation of itertools and lamdas!
|
May 15, 2023, 7:05 p.m. |
+ 1 |
for Comment
radturtle: Nice!
|
May 10, 2023, 7:36 p.m. |
+ 1 |
for Comment
Phil15: For changes to be synced, you have to sync them and wait a little bit (usually a few seconds, unless...
|
May 10, 2023, 7:36 p.m. |
+ 1 |
for Comment
Phil15: If my help on your previous [pull request](https://py.checkio.org/forum/post/15668/a-bit-confused/) ...
|
May 9, 2023, 4:06 p.m. |
+ 1 |
for Comment
LuckySmoke: Beautiful, I don't think there can be a shorter or clearer solution for this one
|
May 8, 2023, 5:55 a.m. |
+ 1 |
for Comment
imloafer: good
|
May 7, 2023, 6:50 p.m. |
+ 1 |
for Comment
kdim: Good job!
|
May 2, 2023, 8:40 p.m. |
+ 1 |
for Comment
Pavellver: Great regular expression!
|
May 2, 2023, 5:29 a.m. |
+ 1 |
for Comment
Red_Ale: Thanks. At that time I didn't know how to use the exception, today I would use it.
|
May 1, 2023, 6:58 p.m. |
+ 1 |
for Comment
Phil15: For me, `partial(sorted, key=...)` was just mandatory. I think the mission should have been to write...
|
May 1, 2023, 5:56 a.m. |
+ 1 |
for Comment
Red_Ale: I am learning here about of a lot of modules that I don't know... Definitely groupby works easier fo...
|
April 30, 2023, 8:57 p.m. |
+ 1 |
for Comment
Red_Ale: At that time, I didn't know regex module :P.
|
April 30, 2023, 3:07 p.m. |
+ 1 |
for Comment
Max0526: Best one so far!
|
April 30, 2023, 8:44 a.m. |
+ 1 |
for Comment
kdim: Yeap, im too! :)
|
April 30, 2023, 8:11 a.m. |
+ 1 |
for Comment
Red_Ale: Thanks. At the end you find it using regex, I am still fighting with that module :)
|
April 30, 2023, 8:09 a.m. |
+ 1 |
for Comment
Red_Ale: I am trying to learn and use it. Still a rookie on that module
|
April 29, 2023, 10:09 p.m. |
+ 1 |
for Comment
Pavellver: Thank you for method ascii_lowercase! It is new for me.
|
April 29, 2023, 11:05 a.m. |
+ 1 |
for Comment
Pavellver: Thank you for little challenge! I added a key {" ": " "} and easily wrote a one-line solution. def m...
|
April 29, 2023, 10:34 a.m. |
+ 1 |
for Comment
kdim: Good work! Also you can use flag "re.IGNORECASE" import re def checkio(words): return bool(re.search...
|
April 29, 2023, 8:45 a.m. |
+ 1 |
for Comment
Phil15: - heapify changes a list order for "heap"-use: only necessarily if the list has two elements or more...
|
April 29, 2023, 8:16 a.m. |
+ 1 |
for Comment
Phil15: heapq is my favorite module (after the essential itertools) as priority queues are a super nice data...
|
April 28, 2023, 7:14 p.m. |
+ 1 |
for Comment
Max0526: Could have been a one-liner.
|
April 27, 2023, 6:05 p.m. |
+ 1 |
for Comment
Kolia951: Thanks, guys! This is very convenient to see all stations on the right side of the screen. I no need...
|
April 24, 2023, 5:44 p.m. |
+ 1 |
for Comment
Bibiche: I would like to thank Bryukh, PositronicLlama, Bilou06, and so many others too : when I began with C...
|
April 23, 2023, 7:51 p.m. |
+ 1 |
for Comment
Red_Ale: I love using recursion when possible :)
|
April 17, 2023, 4:31 p.m. |
+ 1 |
for Comment
Red_Ale: good work. Good idea using existing modules ipaddress to solve this task.
|
April 13, 2023, 3:05 p.m. |
+ 1 |
for Comment
Nocturne13: , nice solution, using regex in combination with a nested loop.
|
April 5, 2023, 7:55 p.m. |
+ 1 |
for Comment
Red_Ale: I really like the using of RE module for this mission
|
March 25, 2023, 5:16 p.m. |
+ 1 |
for Comment
SIRvice: yup
|
March 15, 2023, 5:15 p.m. |
+ 1 |
for Comment
Kolia951: Nice solution! Why don't you inherit from Lancer() for example? Do not see the big reason to create ...
|
March 13, 2023, 4:51 p.m. |
+ 1 |
for Comment
kdim: You have a non-standard solution!
|
March 9, 2023, 7:20 p.m. |
+ 1 |
for Comment
dig: Very smart replace in order to be able of using striptime! Sadly I couldn't realize when I did my co...
|
Feb. 25, 2023, 7:02 a.m. |
+ 1 |
for Comment
kdim: Thank you! I like minimalism ;-) And my code is not optimal and structured. Make it fast.
|
Feb. 24, 2023, 8:18 p.m. |
+ 1 |
for Comment
kdim: Great usage scipy!
|