39
Horatiu Crista
Last seen 1 day ago
Member for 2 years, 6 months, 15 days
Difficulty Normal
Python, Python, Python...
May 16, 2024, 6:40 p.m. | + 5 | for First-juestr |
May 16, 2024, 6:39 p.m. | + 5 | for First-mafaz |
May 16, 2024, 6:39 p.m. | + 5 | for First-mennadiego |
May 8, 2024, 3:50 p.m. | + 5 | for First-arutyunyan |
April 29, 2024, 10:56 a.m. | + 5 | for First-solnischka78 |
April 29, 2024, 10:56 a.m. | + 5 | for MySolutionBackwardString-jemg2030 |
April 29, 2024, 10:55 a.m. | + 5 | for First-vbncursed |
April 26, 2024, 4:15 p.m. | + 5 | for flat matrix-Sioul |
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 16, 2024, 8:55 p.m. | + 5 | for regex-StefanPochmann |
April 16, 2024, 8:53 p.m. | + 5 | for simple and eazy-tamagoyaki |
April 16, 2024, 8:51 p.m. | + 5 | for sum, one line-kdim |
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 |
April 1, 2024, 3:56 p.m. | + 5 | for use slices-kdim |
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:30 a.m. | + 5 | for classic-kdim |
March 30, 2024, 9:28 a.m. | + 5 | for split-kdim |
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 27, 2024, 5:37 p.m. | + 5 | for First-tokiojapan55 |
March 27, 2024, 5:36 p.m. | + 5 | for cycle and itemgetter-tokyoamado |
March 27, 2024, 5:35 p.m. | + 5 | for First-freeman_lex |
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 |
March 20, 2024, 5:41 p.m. | + 5 | for lambda-Max0526 |
March 20, 2024, 5:38 p.m. | + 5 | for classic-kdim |
March 20, 2024, 5:36 p.m. | + 5 | for most short-tamagoyaki |
March 14, 2024, 5:52 p.m. | + 5 | for str replace one line-kdim |
March 14, 2024, 5:49 p.m. | + 5 | for using this precondition "Given int is below or equal of 1500". And I made the code simple.-tamagoyaki |
March 14, 2024, 5:46 p.m. | + 5 | for lambda with re-Max0526 |
March 6, 2024, 6:53 p.m. | + 5 | for reduce-Cjkjvfnby |
Feb. 29, 2024, 5:50 p.m. | + 5 | for First-B_dur |
Feb. 24, 2024, 10:04 a.m. | + 5 | for First-mortonfox |
Feb. 21, 2024, 6:06 p.m. | + 1 | for Comment veky: I'm glad you like them. :) |
Feb. 18, 2024, 9:23 a.m. | + 5 | for Another derelict battery-veky |
Feb. 15, 2024, 9:29 p.m. | + 5 | for Annotated Answers for "Beginning Zeros"-BootzenKatzen |
Feb. 15, 2024, 9:27 p.m. | + 5 | for one-liner-Max0526 |
Feb. 15, 2024, 9:25 p.m. | + 5 | for First-tamagoyaki |
Feb. 2, 2024, 4:38 p.m. | + 5 | for Low Level-PositronicLlama |
Jan. 24, 2024, 7:38 a.m. | + 5 | for First-Pavellver |
Jan. 24, 2024, 7:37 a.m. | + 5 | for dictionary + lambda as a replacement for switch-kdim |
Jan. 24, 2024, 7:31 a.m. | + 5 | for I think I overcomplicated lol-BootzenKatzen |
Jan. 19, 2024, 5:53 p.m. | + 5 | for Explaining the solutions so I understand them-BootzenKatzen |
Jan. 19, 2024, 5:49 p.m. | + 5 | for lambda-Max0526 |
Jan. 19, 2024, 5:46 p.m. | + 5 | for First-Pavellver |
Jan. 16, 2024, 5:51 p.m. | + 5 | for First-vtflnk |
Jan. 16, 2024, 5:49 p.m. | + 5 | for First-vtflnk |
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. 9, 2024, 4:47 p.m. | + 5 | for ok, money method is too complicated :)-marcopunteri |
Jan. 9, 2024, 4:46 p.m. | + 5 | for First-freeman_lex |
Jan. 9, 2024, 4:45 p.m. | + 5 | for First-kanzaki00150 |
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. 30, 2023, 9:07 p.m. | + 5 | for Intersecting rays-Kolia951 |
Dec. 30, 2023, 9:06 p.m. | + 5 | for First-Tanis1981 |
Dec. 30, 2023, 9:06 p.m. | + 5 | for Slope-intercept form and distance calculations-kkkkk |
Dec. 30, 2023, 9:02 p.m. | + 5 | for Regex solves charades-Kolia951 |
Dec. 25, 2023, 7:35 a.m. | + 5 | for First-dr.dylan.ren |
Dec. 25, 2023, 7:35 a.m. | + 5 | for First-tamagoyaki |
Dec. 25, 2023, 7:34 a.m. | + 5 | for First-Tanis1981 |
Dec. 25, 2023, 7:33 a.m. | + 1 | for Comment alamin0489: clear |
Dec. 17, 2023, 9:44 a.m. | + 5 | for real base-veky |
Dec. 11, 2023, 6:27 p.m. | + 5 | for ChainMap & Counter-gyahun_dash |
Dec. 11, 2023, 6:26 p.m. | + 5 | for Recursive-Leonix |
Dec. 11, 2023, 6:25 p.m. | + 5 | for Letter frequencies for word lengths and positions in word-cerankas |
Dec. 11, 2023, 6:17 p.m. | + 5 | for First-DannielLau |
Dec. 11, 2023, 6:17 p.m. | + 1 | for First-DannielLau |
Dec. 2, 2023, 5 p.m. | + 5 | for First-mountian712 |
Nov. 29, 2023, 5:35 p.m. | + 5 | for First-Pavellver |
Nov. 29, 2023, 5:33 p.m. | + 5 | for strptime.strftime-kdim |
Nov. 29, 2023, 5:31 p.m. | + 5 | for One For-oduvan |
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. 23, 2023, 6:23 p.m. | + 5 | for Regex in one line-Kolia951 |
Nov. 23, 2023, 6:22 p.m. | + 5 | for Simple for loop-malion |
Nov. 18, 2023, 11:35 a.m. | + 5 | for First-freeman_lex |
Nov. 16, 2023, 4:54 p.m. | + 1 | for Comment Kolia951: Agree with other comments! Very nice and pythonic solution. |
Nov. 16, 2023, 4:05 p.m. | + 5 | for First-cerankas |
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. 8, 2023, 7:52 p.m. | + 5 | for First-mini.maus87 |
Nov. 8, 2023, 7:50 p.m. | + 5 | for Updated-freeman_lex |
Nov. 8, 2023, 7:49 p.m. | + 5 | for First-brownie57 |
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! |