40
oduvan
● 15 ● 34 ● 57
10059/ 10664
Awesome Team Alexander Lyabah http://www.checkio.org/user/oduvan/
Last seen 14 hours ago
Member for 13 years, 10 months, 21 days
Difficulty Easy
love it!

Best reviews / Newest reviews
First-Julia_Makeyeva
line 9: result[x] = my_text.count(x) More
First-alex.kov 1
а почему не result = ''result += x More
First-NikitaYatsura
text.split() - делаешь дважды. А как сделать так, чтобы только один раз? More
First-ukrainer.dp
перед отправлением решение, лучше все-же убирать лишние комментарии. More
First-ukrainer.dp
чтобы не делать вот такую лестницу из if-ов def checkio(data: str) -> bool: if len(data)>=10: if re.search(r"[A-Z]", data): if re.search(r"[a-z]", data): if re.search(r"[0-9]", data): return True else: More
First-Alex_Rybalka 1
HUM = self.human.h_quotes ROB = self.robot.r_quotes не надо капслочить для локальных переменных More
First-Alex_Rybalka 1
к чему эти ванлайнеры на 26ой и 28ой строке? More
160 Symbols :)-anatoly.kussul
perfect for creative category, thank you More
Cipher map-narimiran
I love that you did it not as one-liner More
Cipher map-Kamil112
it is better to say `actual_position` More
First-akisame338
+5 for me for not using 4-s in code :) More
First-johan4622
it is better to use zip instead of enumerate here. More
First-Kairat 1
I think it is an incorrect solution. No? More
First-boris.pilka
it is good that you know enumerate. More
First with OrderedDict from collections-Molot
This is an interesting idea of keeping order and removing duplicates. More
First-arbores401
I like your solution. How you split it on sub-function to make the logic more clear Thank you More
First-barnadebnath0030
string can be a bad name because of the same name built-in module exist More
Solution Number Length-RobWcool 1
in order to solve this problem you don't need any new variables in your function. Why? More
Python sort with function keys-wtprogrammer7
wow... this is a lot of traces here :) More
First-Toma__Kara
when I see for...append, I always think yield More
1 2 3 4 5
6
7 8 9 10 11 12 13 14 15 16