artemrudenko profile - python coding challenges

36

nickie

Ignalion's twist-nickie 3 2

The only thing to add here is that it's recomended to use isinstance instead of type. More

21

spoty

BFS paths-spoty 2

Cool, small tips: for x in range(0,8): No need to specify 0 in range, e.g. can be replaced with: for x in range(8): Two 'for' statements can be replaced with itertools.product: for x in range(0,8): for y in range(0,8): is the same as: for x, y in product(range(8), range(8)) More

23

LexCavalera

First-LexCavalera 2

Note that rotate in Python can be done easier zip(*original[::-1]) More

49

Sim0000

First-Sim0000 2 2

ifs))) each and every time i am seeing a lot of ifs i wonder about switch...case. Unfortunatelly in python we have only dicts to somehow cover switch..case functionality. In any case thumbs up))))) More

7

cdthurman

First-cdthurman 2 1

It's not a very good practice to use 'sum' as variable name. More

15

skyJuice

First-skyJuice 2

To get rid of i[0] and i[1] you can write: for rshift, cshift in moor: Aslo there is no any need to use redundant parentheses in the code below: if(0<=row+i[0]More

33

bukebuer

First-bukebuer 2 1

Not a good idea to redefine 'sum' as a variable since it is a python core function. Also there is not need to do split: int(cmd.split(' ')[1]) - you can use int(cmd[-1]) instead. More

31

Cjkjvfnby

sorted-Cjkjvfnby 1

Awesome))) I have used almost the same idea, however i have created too many redundant checks More

15

Paul92

First-Paul92 1 1

From the stackoverflow and some python speed tips and trics is not a good way to shift list right using pop and insert. Specifically insert is a very slow list operation. Instead of your rot(l) function you can take a look at collections.deque.rotate. More

44

gyahun_dash

4th-gyahun_dash 1 1

Small addition is that you can replace 'sorted(enum(rods), key = lambda ir: ir[1])' with 'sorted(enum(rods), key = itemgetter(1))' More

21

shota243

First-shota243 1 1

Nice, seems we think the same way)) at least while creating solution for this task More

21

artemrudenko

First-artemrudenko 1 1

Thank you all for your comments. This solution has been written a long time ago and as you all probably know no one able to edit it. What i am asking you is to give full review with comments instead of commenting ugly and etc. I know this - trust me. Thank you More

31

Amachua

Recursive-Amachua 1 2

What i like in your solutions is that they are always well documented! More

14

tobytobytoby

First Fractions-tobytobytoby 1

Nice, but think that this is not a good practice to use 'import *' especially in case when you need only 'Fractions'. Also is not really needed to wrap return result to list. More

15

erik.white.2014

Simple hashlib - First-erik.white.2014 1

You can use getattr(hashlib, algorithm) instead of if here. In any case - cool. More

6

brianraythomas

for/try-brianraythomas 1 1

Quite an interesting solution. I never thought that it can be done this way(from my point of view - quite unpythonic). More

49

Sim0000

First-Sim0000 1

Interesting, i like how you did this. More

8

Nik05

First: Simple areas-Nik05

Cool, but what if to calculate len(args) once and use calculated value then? More

33

bukebuer

First-bukebuer 1

Cool, note that you can use Fraction(1) instead of Fraction(1, 1)(https://docs.python.org/2/library/fractions.html#module-fractions) More

31

Cjkjvfnby

reduce-Cjkjvfnby

Great, that what i was thinking about, but not succeded. The best sample of reduce and operator using. More