oduvan profile - python coding challenges

oduvan

[Follow]

● 15 ● 34 ● 57

10059/ 10664

Awesome Team Alexander Lyabah http://www.checkio.org/user/oduvan/

Last seen 1 day ago

Member for 13 years, 10 months, 21 days

Difficulty Easy

love it!

Best reviews / Newest reviews

suic

alexgerdom's one-linerized-suic 1

:) now we should have "3rd party Creative" category More

modolee

First-modolee 1 1

you can do simplier else -delta.days you can also use abs function More

fomenbox

First-fomenbox 1

Отличное решение. ) перед .split не надо. More

fomenbox

First-fomenbox 1

Супер! Только не стесняйся использовать более осмысленные имена переменных. Тогда код будет чуть легче читаем * vowels * consonants * words More

Sim0000

re.sub-Sim0000 1

I think I saw something like this already, but instead of your like 6 it was replace expression. More

Magu

First (='ω'=)-Magu 1 1

good, except you don't need square brackets in sum. So you work with generator instead of list comprehension More

Sim0000

First-Sim0000 1

I think having a simple marker `is_abs` can replaces lines 2 and 9 by: is_abs = path.startswith('/') if is_abs: return '/' More

Rounin

First-Rounin 1

this is a pretty creative, why "Uncategorized" ? :) More

Moff

First-Moff 1

Wow, I would say it is a very creative solution, especially line 5 More

Pouf

Very Simple-Pouf 1 1

Video Code Review https://youtu.be/196f9o5KPqU?t=7m17s More

Domenica_Coello

Second-Domenica_Coello 1 1

too many scopes. def index_power(a, n): if len(a)-1 < n: return -1 else: return a[n]**n More

AleksandrKasianov

Binary count-AleksandrKasianov 1

I've just found out that definition of `str.count` is different than `list.count` >>> help(list.count) count(...) L.count(value) -> integer -- return number of occurrences of value >>> help(str.count) count(...) S.count(sub[, start[, end]]) -> int More

Sim0000

re.sub-Sim0000 1 1

Wow, now I learn "nonlocal" function More