36
U.V
15 40 51
8141/ 8195
Last seen 2 days ago
Member for 2 years, 2 months, 13 days
Difficulty Easy
Best reviews / Newest reviews
Simple recursion-genadiik
This is simple and clear solution More
First-sidorov
> global MORSE > is not needed More
Complex-Phil15 1
> x + 1j * y Why not complex(x,y) ? More
First-U.V
DFS with restriction of path length More
Counter-gyahun_dash
I liked the use of the itertools.product in this context and will use it More
First-juestr 1
Try / except gives elegant solution, is an acceptable solution in training but not recommended in production. More
using three depth loop!-tamagoyaki
You can replace 3 deep loops by itertools.product B-) More
from itertools import not compress-veky
Wery compact and effective solution More
First-Venigret
This is Not pythonik solution B-( More
First-Tinus_Trotyl
Very elegant solution. And using **~X** is fine. More
Sorted dictionary-kkkkk 1
In this case using Counter fron collections is more convenient More
First-f.r2christ
This is a long example how not to write python programs B-) More
Ha-Ha-U.V
Use SET to count the area of squares More
fnmatch.py is used -U.V
Some fucs from fnmatch.py are used More
Counter-Strike-suic
Solution is clear and short. It may be one of the best solution More
zip_longest-flpo
A lot of solutions for **The Hidden Word** use **zip_longest** More
sorted == words-flpo
This is PYTHONIC code. It's really short and clear! More
First-nucweacia94fine
Ha-ha! Using Numpy for this task B-) More
First-Git-Onya
Do not publish test code - it's not interesting B-) More
First-imloafer
Check if a == b == c: return [60, 60, 60] is not needed More
1 2
3
4 5 6 7