39
Horatiu Crista
Last seen 1 day ago
Member for 2 years, 7 months, 1 day
Difficulty Normal
Python, Python, Python...
April 29, 2023, 9:24 p.m. | + 5 | for one string-kdim |
April 29, 2023, 9:22 p.m. | + 5 | for one long string =)-kdim |
April 29, 2023, 9:13 p.m. | + 5 | for Regex will kill me-Kolia951 |
April 29, 2023, 9:11 p.m. | + 5 | for First-lechrudik |
April 29, 2023, 9:09 p.m. | + 5 | for 5 strings-kdim |
April 29, 2023, 9:03 p.m. | + 5 | for two key sorted-kdim |
April 29, 2023, 8:57 p.m. | + 5 | for classic-kdim |
April 29, 2023, 8:55 p.m. | + 5 | for add zeros around of grid and sum slices-kdim |
April 29, 2023, 8:50 p.m. | + 5 | for Numpy-Pavellver |
April 29, 2023, 8:18 p.m. | + 5 | for First-Pavellver |
April 29, 2023, 8:06 p.m. | + 5 | for First-Pavellver |
April 29, 2023, 8 p.m. | + 5 | for First-Pavellver |
April 29, 2023, 7:46 p.m. | + 5 | for First-lechrudik |
April 29, 2023, 11:05 a.m. | + 5 | for First-Pavellver |
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:56 a.m. | + 5 | for numpy for easy rotations, itertools.compress and zip (length-check py3.10+)-Phil15 |
April 29, 2023, 10:48 a.m. | + 5 | for v3: Dynamic Programming, more memory-friendly for large numbers-Phil15 |
April 29, 2023, 10:45 a.m. | + 5 | for match case-kdim |
April 29, 2023, 10:39 a.m. | + 5 | for classic-kdim |
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, 10:31 a.m. | + 5 | for re-juestr |
April 29, 2023, 10:27 a.m. | + 5 | for analytical-juestr |
April 29, 2023, 9:07 a.m. | + 5 | for First-Pavellver |
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 29, 2023, 8:16 a.m. | + 5 | for First-Pavellver |
April 29, 2023, 8:04 a.m. | + 5 | for First-mikaeldovbnia |
April 29, 2023, 7:58 a.m. | + 5 | for Two versions: Max-heap, Min-heap, 4 lines each-Phil15 |
April 29, 2023, 7:49 a.m. | + 5 | for groups of signed diffs-Phil15 |
April 29, 2023, 7:42 a.m. | + 5 | for Bool-Red_Ale |
April 29, 2023, 7:39 a.m. | + 5 | for First-Red_Ale |
April 29, 2023, 7:34 a.m. | + 5 | for Simple-bryukh |
April 28, 2023, 8:10 p.m. | + 5 | for First-Pavellver |
April 28, 2023, 7:57 p.m. | + 5 | for First-kdim |
April 28, 2023, 7:48 p.m. | + 5 | for re.sub + while-kdim |
April 28, 2023, 7:34 p.m. | + 3 | for First-kdim |
April 28, 2023, 7:24 p.m. | + 5 | for sum and recursion, one line-kdim |
April 28, 2023, 7:14 p.m. | + 1 | for Comment Max0526: Could have been a one-liner. |
April 28, 2023, 7:10 p.m. | + 5 | for Annotated "Bird Language"-BootzenKatzen |
April 28, 2023, 6:44 p.m. | + 5 | for All answers explained so I understand-BootzenKatzen |
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 26, 2023, 8:11 p.m. | + 1 | for Welcome Station Page Remastered! |
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 24, 2023, 5:39 p.m. | + 4 | for First-Pavellver |
April 24, 2023, 5:24 p.m. | + 5 | for First OOP-Pavellver |
April 24, 2023, 5:11 p.m. | + 5 | for recursion-kurosawa4434 |
April 23, 2023, 7:51 p.m. | + 1 | for Comment Red_Ale: I love using recursion when possible :) |
April 23, 2023, 7:45 p.m. | + 5 | for First-Red_Ale |
April 23, 2023, 7:41 p.m. | + 5 | for First-DronovDen |
April 23, 2023, 7:37 p.m. | + 5 | for Recursion-Red_Ale |
April 23, 2023, 7:33 p.m. | + 1 | for Task Nonogram Encode |
April 23, 2023, 7:32 p.m. | + 1 | for Task Magic Square |
April 23, 2023, 6:17 a.m. | + 5 | for zip and split-kdim |
April 22, 2023, 8:10 p.m. | + 5 | for First-Tinus_Trotyl |
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 16, 2023, 8:51 p.m. | + 5 | for classic-kdim |
April 15, 2023, 11:02 p.m. | + 5 | for re.search-kdim |
April 15, 2023, 10:57 p.m. | + 5 | for First-oduvan |
April 14, 2023, 3:15 p.m. | + 5 | for defaultdict-kdim |
April 13, 2023, 7:26 p.m. | + 5 | for clear maths-kdim |
April 13, 2023, 7:21 p.m. | + 5 | for First-eegoldstraw |
April 13, 2023, 7:18 p.m. | + 3 | for replace '[' and ']'-dig |
April 13, 2023, 7:13 p.m. | + 5 | for First-Red_Ale |
April 13, 2023, 7:06 p.m. | + 4 | for First-Pactp |
April 13, 2023, 6:52 p.m. | + 5 | for Generate ugly numbers in a priority queue to get them in order-Phil15 |
April 13, 2023, 6:48 p.m. | + 3 | for Special math method-Nocturne13 |
April 13, 2023, 3:05 p.m. | + 1 | for Comment Nocturne13: , nice solution, using regex in combination with a nested loop. |
April 8, 2023, 8:57 p.m. | + 5 | for Backtracking, filling the most constrained words first-Rcp8jzd |
April 8, 2023, 3:55 p.m. | + 5 | for First-aquazul |
April 5, 2023, 7:55 p.m. | + 1 | for Comment Red_Ale: I really like the using of RE module for this mission |
April 2, 2023, 5:47 a.m. | + 5 | for First-colinmcnicholl |
April 2, 2023, 5:46 a.m. | + 5 | for First-DronovDen |
April 2, 2023, 5:45 a.m. | + 5 | for OOP. Chapter five-swagg010164 |
March 27, 2023, 5:35 p.m. | + 5 | for First-M0PK0BKA |
March 27, 2023, 5:33 p.m. | + 5 | for Simple and readable-malion |
March 27, 2023, 5:32 p.m. | + 5 | for Set the elements-mikaeldovbnia |
March 25, 2023, 5:16 p.m. | + 1 | for Comment SIRvice: yup |
March 21, 2023, 5:04 p.m. | + 5 | for First-kdim |
March 21, 2023, 5:02 p.m. | + 5 | for sum + for-kdim |
March 18, 2023, 9:15 a.m. | + 5 | for 3 guesses max: divisor with max futures remainders to divide possibilities-Phil15 |
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, 7:21 p.m. | + 5 | for diff sets-kdim |
March 13, 2023, 7:07 p.m. | + 5 | for First-kdim |
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... |
March 5, 2023, 12:48 p.m. | + 5 | for Enum + cycle-swagg010164 |
March 5, 2023, 12:42 p.m. | + 5 | for Compare with Roman-veky |
March 5, 2023, 12:40 p.m. | + 5 | for hard way =)-kdim |
Feb. 27, 2023, 8:11 p.m. | + 5 | for recursion-kdim |
Feb. 25, 2023, 11:56 a.m. | + 5 | for sorry-oduvan |
Feb. 25, 2023, 8:34 a.m. | + 5 | for for and items.count-kdim |
Feb. 25, 2023, 8:28 a.m. | + 5 | for sorted-kdim |
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, 9:05 p.m. | + 5 | for recursion-kdim |
Feb. 24, 2023, 8:46 p.m. | + 5 | for First-kdim |
Feb. 24, 2023, 8:18 p.m. | + 1 | for Comment kdim: Great usage scipy! |
Feb. 24, 2023, 8:18 p.m. | + 1 | for Comment kdim: So many conditions :( |
Feb. 20, 2023, 4:30 p.m. | + 1 | for Comment hkgok1: Excellent and like the usage of replace |
Feb. 11, 2023, 10:04 p.m. | + 5 | for First-oduvan |
Feb. 9, 2023, 8:18 p.m. | + 1 | for Comment dig: This month I learnt how to use Regular Expressions. But still far away to use them like you did! Wel... |