thealfest1 profile - python coding challenges

thealfest1

[Follow]

● 5 ● 18 ● 34

3367/ 3445

theALFEST

Last seen 5 months ago

Member for 5 years, 5 months, 5 days

Difficulty Normal

Best reviews / Newest reviews

Simple-thealfest1 1

Corrected version: def goes_after(word: str, first: str, second: str) -> bool: return -1 < word.find(second) - 1 == word.find(first) More

one line regular expression-PythonWithPI 1 1

it`s slower than 'text.split()[0]' and 'text[:text.index(' ')]' More

First-freeman_lex

[x for x in a.lower() if x.isalpha()] More

First-andreas-31

temp_dict = flatten(value, new_key) if len(value) More

Sort, even/odd and formula-MarcosRecio 1

You can replace 'if len(l)%2!=0:' with 'if len(l)%2:' More

Common-coldyride

It`s more creative than simple! More

"Digits Multiplication"-andrey_sh

You can replace if i != "0": with if int(i): More

4 different solution-Detka_v_Ogne

Instead of a, b = min(a,b), max(a,b) You can use a, b = sorted((a,b)) More

First-beiguanzhe

You can use "%" operator. self.idx = (self.idx + 1) % 4 More

First Word-hyl3rid

return text.replace("."," ").split()[0].split(",")[0] More

Third-Urza 1

btw, you don`t need [] inside join More

First-nechayevyaroslav

Hi, nice solution. bin returns string, so you don`t need str(). More