9
julieno
● 1 ● 6 ● 22
407/ 445
Alexey Dvoretskiy http://www.alexfast.org/
Last seen 5 years ago
Member for 7 years, 4 months, 17 days
Difficulty Normal
Data Engineer

Best reviews / Newest reviews
Non Unique Elements-sai.annum 1
Classy! Great solution. Just as it suppose to be. More
Getting this floating point arithmetics right, was not "simple"-Beaxx 1 1
Great solution! Clear and well structured! More
First-kurosawa4434 1 1
You don't need to generate Fibonacci numbers up to 10000. Less than 5000 is more than enough. Also to avoid infinite loops is good practice. More
Digits Multiplication-KacperBeisert
str() takes lots of computational resources. This task can be don't in effective way without converting to string. More
NumBase-Leonid_Khomenko
Nice, effective code. But can be done without converting to list. Also there is a simple solution with int() function. More
First-f_rin_kazan
Good algorithm! Easy to read and understand. More
First-penninga
Using same code 2 times "[c for c in sorted(list(anagram.lower())) if c.strip()]" you could put it into separate function. More
sneaky offset-Renelvon
Solution is incorrect. Error on even length test case. More
First-vorobyev.roma
why don't you use strip() or replace() methods? More
First-mumbling
Very smart. No conversions from string to sets or lists. More
First-t4n017 1
Not sure why you need this line: a2, b2, c2 = a**2, b**2, c**2. Also, weird naming a2 is not a**2. More
First-tarjeii
You could generate Fibonacci sequence. More
First-Gabe_K
Interesting. Different approach. More
First-mozkfestival
Why don't you calculate Fibonacci numbers? More
Avoiding re-soloveyalexey
Interesting solution, not quite clear though. More
First-joicylee22
Very good usage of fib function to create list. More
First-RRRQ
: and ; are punctuation marks as well :) More
First-LenaBobuh
Excellent! Great idea of fib(n) function! More
Stackless-blabaster
Not very "Clear" what "while s:" does. I'd say it's "Creative" solution. More
First-hypehr96
"if l in '{[(}])'" would be easier to read, but yours solution should work faster. More
1
2