Oct. 9, 2022, 10:17 p.m. |
+ 1 |
for
Hints for Mission
|
Oct. 7, 2022, 12:14 p.m. |
+ 1 |
for Comment
masterbikoo: Why not just use built-in string methods?
|
Oct. 7, 2022, 12:13 p.m. |
+ 1 |
for Comment
georimer: You are cheater :D
|
Sept. 30, 2022, 11:14 a.m. |
+ 1 |
for Task
Digit Stack
|
Sept. 30, 2022, 9:47 a.m. |
+ 1 |
for Comment
viktor.chyrkin: I guess I'm a experienced programmer plus.
|
Sept. 30, 2022, 9:46 a.m. |
+ 1 |
for Comment
hanpari: Dont worry you are probably not, you are just able to do it :) Just imagine scene in which Veky is m...
|
Sept. 30, 2022, 9:46 a.m. |
+ 1 |
for Comment
veky: I do have an inclination to argue, but I like to maintain the illusion that I have a consistent worl...
|
Sept. 30, 2022, 9:45 a.m. |
+ 1 |
for Comment
hanpari: Competition is fine. But I was referring to not so easy-to-understand_what_is_checkio_about home pag...
|
Sept. 30, 2022, 9:44 a.m. |
+ 1 |
for Comment
hanpari: I know this page, probably really mysterious for all newcomers :) By the way, I was reffering to it ...
|
Sept. 30, 2022, 9:44 a.m. |
+ 1 |
for Comment
hanpari: I am sorry to say it but what I miss is simply statement: "What is checkio about?" Game for coders? ...
|
Sept. 29, 2022, 7:49 p.m. |
+ 1 |
for Task
Lightbulb More
|
Sept. 29, 2022, 8:18 a.m. |
+ 1 |
for Task
Common Tail
|
Sept. 27, 2022, 9:11 a.m. |
+ 1 |
for Task
Pattern Recognition
|
Sept. 27, 2022, 8:25 a.m. |
+ 1 |
for Comment
Phil15: I was at first really pissed of by those unnecessary zeros (that and something about columns) until ...
|
Sept. 27, 2022, 8:15 a.m. |
+ 1 |
for Task
Flood Area
|
Sept. 22, 2022, 11:14 a.m. |
+ 3 |
for
easy-moonlet
|
Sept. 22, 2022, 11:13 a.m. |
+ 5 |
for
Second-oldjaponec
|
Sept. 20, 2022, 5:17 p.m. |
+ 1 |
for Task
Convert and Aggregate
|
Sept. 20, 2022, 5:13 p.m. |
+ 1 |
for Task
Changing direction
|
Sept. 20, 2022, 5 p.m. |
+ 1 |
for
CheckiO Intro. Full Version. From Basic to Advance usage.
|
July 27, 2021, 2:13 p.m. |
+ 1 |
for Comment
mindaugas.dadurkevicius: Clear and simple solution.
|
April 15, 2021, 7:37 a.m. |
+ 1 |
for Comment
Steven2222: Next step: pep8
|
April 15, 2021, 7:37 a.m. |
+ 1 |
for Comment
Steven2222: Nice, elegant, clean.
|
March 19, 2021, 2:27 p.m. |
+ 1 |
for Comment
Wakko_Warner: nice!
|
March 15, 2021, 12:40 p.m. |
+ 1 |
for Comment
Kath29: I like your solution a lot, I would just name the variables a-d etc as day, month, year, hours, minu...
|
March 6, 2021, 9:19 p.m. |
+ 1 |
for Comment
phan0304: nice
|
Feb. 20, 2021, 1:29 p.m. |
+ 1 |
for Comment
Calen: now that's educational, thanks!
|
Feb. 18, 2021, 10:49 p.m. |
+ 1 |
for Comment
Oleg_Levonjuk: Very nice!
|
Jan. 20, 2021, 9:14 a.m. |
+ 1 |
for
Conditional ladder-scribani.andres
|
Jan. 20, 2021, 9:14 a.m. |
+ 1 |
for
First-colinmcnicholl
|
Jan. 20, 2021, 9:12 a.m. |
+ 1 |
for
"YAML. More Types"-iskenderunbtr
|
Jan. 20, 2021, 9:11 a.m. |
+ 2 |
for
First-8weipan8
|
Jan. 20, 2021, 9:11 a.m. |
+ 3 |
for
Second-colinmcnicholl
|
Jan. 20, 2021, 9:07 a.m. |
+ 5 |
for
1-liner + imports: O(n²) but faster than with "for"-Phil15
|
Jan. 20, 2021, 8:57 a.m. |
+ 1 |
for Comment
Leo_z: Very creative solution, it's short and efficient, well done !
|
Jan. 16, 2021, 9:01 p.m. |
+ 1 |
for Comment
vby: Good work, simpler than my code :-)
|
Jan. 15, 2021, 4:11 p.m. |
+ 1 |
for Comment
Thanongsak: Very nice code
|
Jan. 14, 2021, 11:51 a.m. |
+ 1 |
for Comment
Kinio: Short and clear
|
Jan. 12, 2021, 8:42 a.m. |
+ 1 |
for Comment
dogeuf: Very short. Nice code
|
Jan. 11, 2021, 9:26 p.m. |
+ 1 |
for Comment
nat.dracheva: Gosh, it's beautiful
|
Jan. 11, 2021, 9:25 p.m. |
+ 5 |
for
Split 'a', replace even, remove 'a'-ail531
|
Jan. 11, 2021, 9:24 p.m. |
+ 1 |
for
split('a')-kurosawa4434
|
Jan. 11, 2021, 9:24 p.m. |
+ 1 |
for Comment
2010min0ru: That is a smart idea to split text in a chunks divided by 'a' symbol! I like it!
|
Jan. 11, 2021, 9:23 p.m. |
+ 1 |
for Task
Caps Lock
|
Jan. 11, 2021, 8:52 p.m. |
+ 1 |
for Comment
oduvan: done. Thank you
|
Jan. 11, 2021, 3:20 p.m. |
+ 1 |
for Comment
rybld2: well structured and everything !!!
|
Jan. 10, 2021, 9:42 p.m. |
+ 1 |
for Task
Graphical Key
|
Jan. 10, 2021, 3:46 p.m. |
+ 1 |
for Post
Another What is wrong?
|
Jan. 10, 2021, 11:18 a.m. |
+ 1 |
for Task
The Stones
|
Jan. 9, 2021, 1:32 a.m. |
+ 1 |
for Comment
Merzix: Maybe grafical stones(9, [1, 3, 4]) will help somehow? I hope there are no more mistakes. :) Filled ...
|
Jan. 8, 2021, 10:54 p.m. |
+ 1 |
for Post
Used functions not counted for progress
|
Jan. 8, 2021, 7:07 p.m. |
+ 1 |
for Task
Treasures
|
Jan. 8, 2021, 3:58 p.m. |
+ 1 |
for Task
Keys and Locks
|
Jan. 8, 2021, 3:52 p.m. |
+ 1 |
for Comment
CrossFireZero: woah! Nice trimming! =)
|
Jan. 8, 2021, 3:52 p.m. |
+ 1 |
for Comment
BrianMcleod: So clear!!!
|
Jan. 8, 2021, 3:52 p.m. |
+ 5 |
for
First-Tinus_Trotyl
|
Jan. 8, 2021, 3:13 p.m. |
+ 1 |
for Comment
bourbaka: I didnt say thats wrong, i just made those mistakes and wanted to help others. By the way, if the hi...
|
Jan. 8, 2021, 3:13 p.m. |
+ 1 |
for Post
some hints
|
Jan. 8, 2021, 10:21 a.m. |
+ 5 |
for
"Unix Match. Part 1"-iskenderunbtr
|
Jan. 8, 2021, 10:20 a.m. |
+ 4 |
for
First-boxdima1
|
Jan. 8, 2021, 10:06 a.m. |
+ 1 |
for
First-tokiojapan55
|
Jan. 6, 2021, 10:30 p.m. |
+ 1 |
for Comment
mlry: Looking good. What will be the advantage of using a try-except-statement instead of a simple "if"? I...
|
Jan. 5, 2021, 7:58 p.m. |
+ 1 |
for Comment
Phil15: As you know, python evolves with time and `lru_cache` did a bit recently. https://docs.python.org/3/...
|
Jan. 5, 2021, 1:42 p.m. |
+ 5 |
for
Naive but cached-Phil15
|
Jan. 4, 2021, 12:27 p.m. |
+ 1 |
for Comment
ogoro: you are right, thanks for the remark!
|
Jan. 4, 2021, 7:24 a.m. |
+ 1 |
for Comment
ogoro: looks cool, thank you) few days ago i found one more 1-level flatting recipe: def flatten(list_of_li...
|
Jan. 2, 2021, 6:36 p.m. |
+ 1 |
for Comment
ogoro: interesting parser) you also could use: n = [x for x in s if x not in '[] '] # eliminate brackets an...
|
Jan. 2, 2021, 6:34 p.m. |
+ 1 |
for Comment
ogoro: nice solution) you could also use: num = None to allow -1 to be present in items
|
Jan. 1, 2021, 3:38 p.m. |
+ 1 |
for
First-Wojciech__Lazuka
|
Jan. 1, 2021, 3:38 p.m. |
+ 1 |
for
Not first-swagg010164
|
Jan. 1, 2021, 3:38 p.m. |
+ 3 |
for
f-strings-David_Jones
|
Jan. 1, 2021, 3:37 p.m. |
+ 2 |
for
First-OrginalS
|
Jan. 1, 2021, 3:36 p.m. |
+ 1 |
for
First-eyesoffish
|
Dec. 28, 2020, 10:29 p.m. |
+ 1 |
for Comment
lfr2lsr: Great, but try using sets too! set1.intersection(set2) will eliminate your loop :)
|
Dec. 28, 2020, 7:11 p.m. |
+ 1 |
for Comment
kurosawa4434: I added random tests and a picture.
|
Dec. 28, 2020, 7:02 p.m. |
+ 1 |
for Task
Park Benches
|
Dec. 27, 2020, 6:06 p.m. |
+ 1 |
for Comment
psycub: nice one!
|
Dec. 24, 2020, 10:09 a.m. |
+ 1 |
for Post
New Mission "Park Benches"
|
Dec. 23, 2020, 1:57 p.m. |
+ 1 |
for Task
Fast Train
|
Dec. 23, 2020, 10:10 a.m. |
+ 1 |
for Comment
oduvan: definitely a bug. Thank you
|
Dec. 22, 2020, 5:42 p.m. |
+ 1 |
for
First-nosomua
|
Dec. 22, 2020, 5:42 p.m. |
+ 1 |
for
First-ash827
|
Dec. 22, 2020, 5:40 p.m. |
+ 1 |
for
Floats and f-strings-kkkkk
|
Dec. 22, 2020, 5:39 p.m. |
+ 1 |
for
Friendly Number-booratello
|
Dec. 22, 2020, 5:39 p.m. |
+ 1 |
for
Naive-obone
|
Dec. 21, 2020, 10:13 p.m. |
+ 1 |
for Comment
andrei.maftei28: Good job! The return statement can also be changed to : "return len(password) > 6".The result will b...
|
Dec. 21, 2020, 4:16 p.m. |
+ 1 |
for Comment
DaveDiFranco: Or you could do: result = result + (10 if s1[:1] == s2[:1] else 0)
|
Dec. 21, 2020, 10:45 a.m. |
+ 1 |
for Comment
Phil15: First you find a good chain. Then you find another that is ok with the first. Then you find another ...
|
Dec. 21, 2020, 10:43 a.m. |
+ 1 |
for Post
Rename 'horses' to 'races'
|
Dec. 21, 2020, 9:16 a.m. |
+ 1 |
for Comment
Phil15: IMO it is one of the most difficult mission here on CheckiO. The checker is not random. Only your so...
|
Dec. 21, 2020, 9:16 a.m. |
+ 1 |
for Comment
Phil15: It's not just `sorted(couple)` but `sorted(family)` too. Easy fix: def find_chains(family, couples):...
|
Dec. 20, 2020, 3:50 p.m. |
+ 1 |
for Task
Loading Cargo
|
Dec. 19, 2020, 10:11 a.m. |
+ 1 |
for Comment
EdinsonUwU: I like this solution, but I do not understand why you do this: small = s[i] s[i] = s[i-1] s[i-1] = s...
|
Dec. 17, 2020, 7:20 p.m. |
+ 1 |
for Post
New Mission "The highest building"
|
Dec. 17, 2020, 2:22 p.m. |
+ 1 |
for Task
The Cheapest Flight
|
Dec. 17, 2020, 2:15 p.m. |
+ 2 |
for
First-PythonLearner
|
Dec. 17, 2020, 2:14 p.m. |
+ 2 |
for
First-l.szyman10
|
Dec. 17, 2020, 1:21 p.m. |
+ 1 |
for Task
Restricted Sum
|
Dec. 17, 2020, 10:05 a.m. |
+ 1 |
for Comment
Patrick_Devaney: taught me about comparing tuples, neat!
|
Dec. 17, 2020, 10:05 a.m. |
+ 1 |
for Comment
piter239: I love this solution for the clarity of it!
|