45
bryukh
16 32 48
15857/ 17173
Valentin Bryukhanov http://bryukh.com/
Last seen 2 years ago
Member for 11 years, 7 months, 16 days
Difficulty Normal
Developer, engineer and taskMaker.

Best reviews / Newest reviews
Lovely prints-Alexis_Bourgoin
And you can use triple quotes and make this without \n More
First-loic2295
"l" is not good name for variables - because it looks like "1" or "I" for many fonts and hard readable. if l % 2 != 0 : can be simpler: if l % 2: Your code is good, but PEP8 and good variables name can make nice code from it. More
Iterate zyx...-jrobbin5
Nice code. You can make a micro-optimisation with letter_count = text.count(letter) With that you don't need count this twice. More
First-Codenburger
Lines 11-12 and "b" variable are redundant. More
First-atzeatze
copyOfData = data For lists it's not a copy, you just created one more link for the same array. If you will change one, then you will change other. You can count elements with the method "count" [1, 2, 3, 1, 1].count(1) # return 3 More
Very ugly solution , I wish I can do better-ahmedaswai
Whitespaces can be useful. PEP8 can make your code is more readable. And "Counter" here is overkill, I think. But I sure you can make this pretty and more simpler. More
Xs and Os Second -cgallant
Sometimes you are using spaces around operators, sometimes - not. Not bad and if you will make it more "general" then it will be nice solution. More
Dijkstra (no fib-heap => O(n^2))-MorrisFeist
Why do you use class here? They look like simple dictionaries here. More
Touch the right wall-maurice.makaay 1
Not universal, but funny :-) And I like "properties". Nice! More
First-undead404 1
Change input data is not a good practice. You can use work = sorted(data) instead line 6-7 amount = len(data) line 9 is overhead if amount % 2: # the same as amount % 2 != 0 and line 13 is not needed. More
First-vojpivna
It's scary. Lines 5-21 are .... More
Dijkstra-Complete-Miaou 1
Nice comments, but too long lines. More
A*-PositronicLlama
Do you think A* is not overkill algorithm for this task? I don't sure about heuristic. But +2 for implementation and +1 for good comments. More
First-bryukh
any([ch.isupper() for ch in data]) and I prefer list comprehension. For memory problem, i can just to replace list comprehension to generator comprehension. If honestly, i don't like map and filter. More
Pedantic-htamas 1
Really pedantic and accurate. Super. More
complex>complicated-veky 1
1e-9??? AAAAA, what is it? Why, why are you breaking my brain. :-D More
First-davidpm 2
" == True" is redundant. "range(0, len(list_of_words))" -- 0 is default, so you can use range(x) == range(0, x) And you can iterate through list instead indexes: for w1 in list_of_words: for w2 in list_of_words: More
Assignment-veky 1
A cool trick with the double assignment. More
3 steps-DiZ 1
How about PEP8 for "Clear"? ;-) More
First-Miaou 1
It's hard to read and too long strings, but it's interesting. More
1 2 3 4 5 6
7
8