U.V profile - python coding challenges

35

swagg010164

1-liner max with key solution (datetime)-swagg010164

Converting dates is not needed at all. It's as simple as: get_latest = max More

41

mortonfox

First-mortonfox

In this case we can compare strings B-) More

36

U.V

Clear & Educatinal-U.V 1

Yes, but this solution is fine, isn't it ? More

57

veky

injectivity-veky 1

It's new for me this original using of __ __import__ __ . I put this trick in my collection ! More

16

elektronky777

First-elektronky777

This solution is NOT SPEEDY ! It is 50 times slover then another speedy solution of ## maybe First ## (https://py.checkio.org/mission/team-play-2/publications/maybe/python-3/first/?ordering=most_voted&filtering=all) More

34

pokosasa

second; recursive-pokosasa

Using recursion in this case is not effective. This solution have only educational and practice goal in resursion. More

25

Oleg_Novikov

First-Oleg_Novikov

Yours solution was suggested for random rewiew as **SPEEDY** solution and i will discuss speedy aspects. 1. Solution will be more speedy if use walrus operator in multiple **pow()** operations. while pow(x,x)< number: x +=1 root_num = 0 if pow(x,x)==number: retur More

44

gyahun_dash

named group-gyahun_dash

I have checked solution and get assertion error at test assert decode_vigenere(u"AAAAAAAAA", u"ABABABABC", u"ABABABABC") == "AAAAAAAAA", "ABABABABC" where valid key is "ABABABABC", but not "ABAB" More

34

DiZ

del-DiZ

Interesting solution. But what title 'del' means ? More

31

Molot

First-Molot

I think that pandas is too heavy weapon to solve this task B-) More

34

Rcp8jzd

Nested defaultdict-Rcp8jzd

This solution is enought clear and documented More

33

kkkkk

Nested dictionaries-kkkkk

Solution is well documented and clear More

25

hkgok1

First-hkgok1

Lines 5-10 : better to set all items of **table** to **price+1** and clear table[0] table = [price+1 for i in range(price + 1)] table[0] = 0 Line 13 and later: Value **j** is not neded since everywere is used **denominations[j]** for denomination in denominations: More

49

Phil15

First-Phil15

Short and clear dolution ! **re** make it so, More

36

nickie

Two rules-nickie

In my mind mines = sum(t[2]==9 for t in neighbors) looks better and clearer than mines = sum(1 for t in neighbors if t[2] == 9) More

21

Igor_Sekretarev

Concise algorithm-Igor_Sekretarev

It's more elegant to use **** in line 11 for i, column in enumerate(, start=1): . . . return [pos+1, i, pos+len(word), i] against for i, column in enumerate())): . . . return [pos+1], i+1, pos+len(word), i+1] since **i** now is agree More