33
Kurush
11 29 56 Leader of the month
6445/ 6695
Kurush Kurushich
Last seen 6 days ago
Member for 11 years, 2 months, 12 days
Difficulty Normal
Best reviews / Newest reviews
keiです、ども(`・ω・´)-s.keigo.11235813 1
Your solution can be reduced to "return items[items.index(border):] if border in items else items". More
Follow instructions-faccanoni
Clear and readable solution. Nice job! More
First-Evgeny_Sergeev
A nice example of using Counter! More
First-cdw
The best possible solution for this task. More
One row solution-Luiza_G
The best possible solution for this task. More
First-Sim0000
I have the same solution here. More
First-ene8255
The best possible solution for this task. More
First-Cordivae
The best possible solution for this task. More
First-johankor
I have the same solution here. Almost all players use this solution but it won’t make it worse. Nice job! More
First-johankor
The best possible solution for this task. More
Second-pokosasa
Your solution is very short and clear. Nice job! More
First-Lemur21
The best possible solution for this task. More
Binary Count-inkayat
The best possible solution for this task. More
First-mindlesswater
You can improve your solution by using slices two times: "return line[-1:]+line[:-1]". More
First-mr-quant
The best possible solution for this task. More
First-makskson
The "if items else items" part of your code wasn't necessary. More
Using enumerate-erykcoapl
Nice job! My solution is almost the same. I used comparison "i == 0" instead of "not i". More
stevenxu77-stevenxu77
I have the same solution. It seems the best for this mission. More
Short one-shm9688
You could improve your solution by reducing it to "return items.count(True) > items.count(False)". More
First-AGrinder
I have the same solution. It seems the best for this mission. More
1 2
3
4 5