Tinus_Trotyl profile - python coding challenges

Tinus_Trotyl

[Follow]

● 14 ● 39 ● 62

11746/ 12903

Awesome Team Tinus Trotyl

Last seen 2 days ago

Member for 7 years, 3 months, 2 days

Difficulty Normal

A little bit of Python with greetings from the Netherlands.

May 19, 2019, 1:03 a.m.	+ 2	for First-Dr__ON
May 19, 2019, 1:02 a.m.	+ 2	for Strip empty, len * len-Olpag
May 19, 2019, 12:59 a.m.	+ 2	for lamda lambda 73 chars-ZweiStein
May 19, 2019, 12:53 a.m.	+ 1	for Comment ZweiStein: Clever, but you should avoid doing two sorts.
May 4, 2019, 2:51 p.m.	+ 4	for __getitem__-Dr__ON
May 4, 2019, 2:50 p.m.	+ 3	for define a getter-quarkov
May 4, 2019, 2:42 p.m.	+ 3	for First-Dima_Shul_chevskij
May 3, 2019, 5:29 p.m.	+ 3	for First -LeonidPK
May 3, 2019, 5:28 p.m.	+ 4	for Regex-igor.v.dudenko
May 3, 2019, 5:28 p.m.	+ 3	for First-Kwangchiu
May 3, 2019, 1:52 p.m.	+ 1	for Comment Evgeny_Andronov: Hi Five!
April 29, 2019, 2:43 p.m.	+ 1	for Comment Ylliw: Great
April 29, 2019, 2:43 p.m.	+ 1	for First-Ylliw
April 22, 2019, 2:12 p.m.	+ 1	for Comment briantruong: woa !!!
April 22, 2019, 2:11 p.m.	+ 1	for Comment MSL: python is so beautiful! nice solution!
April 22, 2019, 2:02 p.m.	+ 1	for Comment Rapunzel85: really short, readable solution. Thanks for sharing
April 13, 2019, 6:01 p.m.	+ 1	for Comment Merzix: No, no, I do not insist, just suggested for review. But thanks for the solution in my honor even tho...
April 13, 2019, 6:01 p.m.	+ 1	for Comment Ilis: xn, yn = neighbour[0], neighbour[1] You can simplify it as xn, yn = neighbour
April 12, 2019, 4:35 a.m.	+ 5	for First-Moff
April 12, 2019, 4:34 a.m.	+ 4	for Check all points-GruffGemini
April 12, 2019, 4:34 a.m.	+ 4	for simple-eogml88
April 12, 2019, 4:21 a.m.	+ 1	for Task Life Counter
April 6, 2019, 12:35 a.m.	+ 1	for Task Evenly Spaced Trees
March 31, 2019, 12:49 p.m.	+ 3	for First-7nat7
March 31, 2019, 12:43 p.m.	+ 4	for First-jasonlau
March 31, 2019, 6:41 a.m.	+ 5	for Recursive search-fed.kz
March 21, 2019, 12:18 a.m.	+ 5	for quite simple-1-more
March 21, 2019, 12:17 a.m.	+ 5	for C3-like-tom-tom_f993b3abc4814d4cb5476e
March 21, 2019, 12:16 a.m.	+ 4	for TreeSearch(BFS)-Kouri
March 20, 2019, 12:39 a.m.	+ 1	for Task Square Board
March 17, 2019, 3:50 p.m.	+ 4	for short complex-DiZ
March 17, 2019, 3:50 p.m.	+ 4	for Complex-Talim42
March 13, 2019, 5:46 p.m.	+ 4	for First-RadekBrich
March 10, 2019, 3:42 a.m.	+ 3	for First-ioginy
March 10, 2019, 3:42 a.m.	+ 3	for First-flmhhh
March 10, 2019, 3:42 a.m.	+ 3	for First-yurimelnyk
Feb. 22, 2019, 5:42 a.m.	+ 5	for 1-liner: shorty-przemyslaw.daniel
Feb. 22, 2019, 5:39 a.m.	+ 5	for all-kurosawa4434
Feb. 18, 2019, 11:18 a.m.	+ 5	for Second-Sim0000
Feb. 10, 2019, 10:18 p.m.	+ 1	for Comment kurosawa4434: What about the intersection of a different brackets? remove_brackets('([)]') == '()' or remove_brack...
Feb. 9, 2019, 10:12 a.m.	+ 4	for First-kurosawa4434
Feb. 4, 2019, 6:29 p.m.	+ 3	for recursive-weirdname
Feb. 4, 2019, 5:35 a.m.	+ 4	for Recursive painting-Leonix
Feb. 4, 2019, 5:35 a.m.	+ 4	for First-StanislauL
Feb. 4, 2019, 5:34 a.m.	+ 4	for First-fed.kz
Feb. 4, 2019, 3:36 a.m.	+ 1	for Comment weirdname: I think there is no need at all to format minutes.
Feb. 4, 2019, 3:36 a.m.	+ 1	for Comment weirdname: I mean, what will change if you delete 5th line? Why do you format minutes? def time_converter(time)...
Jan. 30, 2019, 10:09 p.m.	+ 1	for Task Group Equal consecutive
Jan. 28, 2019, 10:36 p.m.	+ 5	for intersection, issubset, union-kurosawa4434
Jan. 28, 2019, 2:44 p.m.	+ 1	for Comment BrianMcleod: So clear!!!
Jan. 17, 2019, 2:01 a.m.	+ 1	for Comment ACicmansky: Nice way of rotating elements in switch.
Jan. 3, 2019, 5:33 p.m.	+ 1	for Comment oduvan: Happy New Year!!! And thank you all for the 2018! It was really fun!
Jan. 3, 2019, 5:33 p.m.	+ 1	for Comment Sim0000: Happy new year! Let's enjoy coding in this year :-)
Jan. 1, 2019, 12:55 p.m.	+ 1	for Comment Phil15: Happy New Year 2019 to the whole CheckiO community! I learned a lot thanks to you all!
Dec. 23, 2018, 9:59 p.m.	+ 1	for Task Cipher Crossword
Dec. 23, 2018, 9:55 p.m.	+ 5	for Look for sure things thanks to comparisons-Phil15
Dec. 15, 2018, 5:57 p.m.	+ 5	for Second letter of commands is unique-MMM_AAA_NNN
Dec. 15, 2018, 5:57 p.m.	+ 5	for First-cdthurman
Dec. 15, 2018, 5:56 p.m.	+ 5	for First-bukebuer
Dec. 2, 2018, 4:52 p.m.	+ 2	for 19-liner: simple with excluded corner case-przemyslaw.daniel
Dec. 2, 2018, 4:50 p.m.	+ 1	for First-Moff
Dec. 2, 2018, 4:49 p.m.	+ 1	for A novel by...-pon.tu.correo.aca
Nov. 19, 2018, 3:43 p.m.	+ 5	for Translation table (3 steps)-DiZ
Nov. 15, 2018, 3:51 p.m.	+ 1	for Post any geometry idea?
Nov. 3, 2018, 1:17 p.m.	+ 1	for Task Wall Keeper
Oct. 25, 2018, 11:35 a.m.	+ 2	for First-freixodachamorra
Oct. 25, 2018, 11:27 a.m.	+ 1	for Comment tigerhu3180: createive,i like it
Oct. 25, 2018, 11:27 a.m.	+ 1	for Comment Vasily__Chibilyaev: brilliant!
Oct. 20, 2018, 10:23 a.m.	+ 1	for CheckiO tools for creating missions
Oct. 19, 2018, 11:46 a.m.	+ 1	for Comment Turo233: cool!
Oct. 19, 2018, 11:46 a.m.	+ 1	for Comment lukewarm92: Damn it's good!
Oct. 19, 2018, 11:46 a.m.	+ 1	for Comment Juanpalx: The last term ("." if text[-1] != "." else "") is clean and clear. However I would like to suggest a...
Oct. 19, 2018, 6:20 a.m.	+ 1	for Task Rectangles Union
Oct. 18, 2018, 9:39 a.m.	+ 1	for Comment Merzix: Due to DRY you could make a generator from this, and wouldn't have to use locals() (PEP8 "Explicit i...
Oct. 18, 2018, 8:17 a.m.	+ 1	for Comment Merzix: you can try other ways like import string def checkio(data: str) -> bool: check1 = any(filter(string...
Oct. 18, 2018, 7:54 a.m.	+ 1	for Comment Merzix: This is important only for `print()`.
Oct. 18, 2018, 7:52 a.m.	+ 1	for Comment Merzix: Yes, my lapse about `.values()`. But I think the `list` is redundant.
Oct. 18, 2018, 4:43 a.m.	+ 1	for Comment Merzix: It's a crystal clear solution, but I'm sorry, I could not give more than 2 votes up because you go t...
Oct. 17, 2018, 5:09 a.m.	+ 1	for Comment oduvan: Hi Brian Here is a short video that explains how to create missions on CheckiO https://www.youtube.c...
Oct. 16, 2018, 6:26 p.m.	+ 1	for Task House Password
Oct. 16, 2018, 6:21 p.m.	+ 1	for Comment Merzix: Thanks for the offer, but I'd rather vote for yours.
Oct. 16, 2018, 6 p.m.	+ 1	for Comment Merzix: Thanks. You absolutely right! Now I would write best_stock = lambda data: max(data, key=data.get)
Oct. 16, 2018, 5:48 p.m.	+ 1	for First-Merzix
Oct. 13, 2018, 2:26 a.m.	+ 1	for Comment serg3y1999: no problem :)
Oct. 12, 2018, 12:07 p.m.	+ 1	for Comment Merzix: grid = [[chr(ord(c) & 0xFFDF) for c in r] for r in grid] for clear category? Why not just `c.upper()...
Oct. 11, 2018, 1:22 p.m.	+ 1	for Task The Tower
Oct. 10, 2018, 11:55 a.m.	+ 1	for Comment BrianMcleod: Nice running comments. Very clear.
Oct. 7, 2018, 4:20 a.m.	+ 1	for Task Graphical Key
Oct. 7, 2018, 2:15 a.m.	+ 5	for 4-liner!-Merzix
Oct. 7, 2018, 1:37 a.m.	+ 1	for Comment BrianMcleod: Very nice! I like how remainder stays different through the non-repeating numbers and indicates the ...
Oct. 4, 2018, 1:48 a.m.	+ 1	for Task The Buttons
Oct. 4, 2018, 1:25 a.m.	+ 5	for 6 line-Sim0000
Oct. 4, 2018, midnight	+ 1	for Task Card Game
Oct. 3, 2018, 8:46 p.m.	+ 5	for First-mortonfox
Oct. 3, 2018, 9:15 a.m.	+ 1	for Comment serg3y1999: names = [say_number(i) for i in range(1, number + 1)] instead of : names = ','.join((say_number(i) f...
Oct. 3, 2018, 12:20 a.m.	+ 2	for resolve-ndj_ys
Sept. 24, 2018, 10:13 a.m.	+ 1	for Task The Stones
Sept. 23, 2018, 7:13 a.m.	+ 2	for First-Merzix
Sept. 22, 2018, 10:50 p.m.	+ 2	for A bit bulky, yet working and readable solution-swhcz
Sept. 22, 2018, 10:49 p.m.	+ 2	for First-jasonlau

1 2 3

5 6 7 8 9