13
Jiyoqisv
2 16 31
802/ 845
Last seen 9 months ago
Member for 10 years, 1 day
Difficulty Normal
Best reviews / Newest reviews
First-Sim0000 1
I should have put my First solution in "Clear" category as it is exactly the same... More
First-chorna 1 1
using "data.sort()" can definitely not be considered as speedy More
O(n) :-P-veky 1 1
can you explain why "-" between two Counter (is Dict) is O(n) ? More
sort & return-SamClarke 1
using sort function can not be considered as speedy More
First-melpon
yes, one liner with lambda is creative More
First-enagorny
using sort function is not creative imho More
slice-nakano.h
using sort function is not creative imho More
Median-ducthien1490
using sort function is not creative imho More
First-kobashi
using sort function is not creative imho More
First-satou30
using sort function is not creative imho More
First-DanielDou
using sort function is not creative imho More
Woot-ret702
using sort function is not creative imho More
First-ryosms 1
it is fast to write, not to execute => wrong category More
Random Walk-RyanDagg
the more the pyramid will be high, the more likely you won't find the best solution. plus, 30k attempts : YOU'RE OVERHEATING THE PLANET !! More
First-harukero
using sort function can not be considered as speedy More
^-veky 2
use strings instead of bit wise => short but not speedy More
First-shota243
using time, my naive recursive code gives 0m0.106s, yours gives 0m0.687s. More
Second-haoyayoi
O(n^2). You can achieve O(nlogn) or event O(n). More
First-tamacjp
I've quite the same but with simpler synthax. It is O(n**2), there are O(nlogn) solutions. More
heapq-Sim0000
if you aim to cheat, why not use \_\_builtins__ More
1
2