8
Last seen 1 year ago
Member for 5 years, 6 months, 9 days
Difficulty Normal
| Oct. 10, 2022, 6:38 a.m. | + 2 | for
 Slice-Tinus_Trotyl
|
| Sept. 24, 2019, 11:44 p.m. | + 2 | for
 convert_to_minutes-Totheheart
|
| Dec. 26, 2018, 12:16 p.m. | + 1 | for
 same one with f = lambda x : y(x)-Tinus_Trotyl
|
| Nov. 23, 2018, 12:59 p.m. | + 1 | for
 First-vlad.bezden
|
| Nov. 23, 2018, 12:58 p.m. | + 1 | for
The same without `all`-Tinus_Trotyl
|
| Nov. 23, 2018, 12:58 p.m. | + 1 | for
Fifth-tom-tom_f993b3abc4814d4cb5476e
|
| Nov. 23, 2018, 11:46 a.m. | + 1 | for
 First-tom-tom_f993b3abc4814d4cb5476e
|
| Nov. 18, 2018, 12:41 p.m. | + 1 | for Comment bryukh: Just run your solution and mine with timeit and random 10000 length string and you will be wonder by... |
| Nov. 18, 2018, 12:39 p.m. | + 1 | for Comment bryukh: "max" iterate through *ascii_lowercase*. Each letter (a, b, c etc) is processing by "text.count(lett... |
| Nov. 18, 2018, 12:33 p.m. | + 1 | for
 max-count-bryukh
|
| Nov. 18, 2018, 11:20 a.m. | + 1 | for
 Ceph's Refactored-suic
|
| Nov. 18, 2018, 11:20 a.m. | + 1 | for
Regular Expressions-PositronicLlama
|
