Nov. 7, 2021, 6:30 p.m. |
+ 1 |
for Comment
bkaraica: Nice job. Try to solve it with a string slicing and index() method. It can be a oneliner.
|
Nov. 7, 2021, 6:25 p.m. |
+ 1 |
for Comment
osvaldo.gusmao: very complex
|
Nov. 7, 2021, 6:25 p.m. |
+ 1 |
for Comment
nat.dracheva: Good!
|
Nov. 7, 2021, 6:25 p.m. |
+ 1 |
for Comment
Hunteena: Hard work there! But the code could be much simpler if **set** and **join** were used. Also the nest...
|
Nov. 7, 2021, 6:25 p.m. |
+ 1 |
for Comment
PaulaVioleta: very clear!, good step by step.
|
Nov. 7, 2021, 6:21 p.m. |
+ 1 |
for Comment
nitinrathi1997: nice
|
Nov. 7, 2021, 6:20 p.m. |
+ 1 |
for Comment
multicast: Nicely done, gets the job done; My approach was: if border in items: in_border = items.index(border)...
|
Nov. 7, 2021, 6:20 p.m. |
+ 1 |
for Comment
jefoon93: nice laughter lol
|
Nov. 7, 2021, 6:20 p.m. |
+ 1 |
for Comment
ChromeBrainer: that one is longer!
|
Nov. 7, 2021, 6:20 p.m. |
+ 1 |
for Comment
ChromeBrainer: the same method is in trend!
|
Nov. 7, 2021, 6:20 p.m. |
+ 1 |
for Comment
jadczak: Quick tips, strings in python can be iterated on natively. So instead of writing this: while i < len...
|
May 13, 2021, 4:37 a.m. |
+ 2 |
for
god function ?naaaaah-Lumy
|
May 13, 2021, 4:37 a.m. |
+ 3 |
for
First-l.szyman10
|
May 13, 2021, 4:37 a.m. |
+ 3 |
for
straight forward solution-nickgryg
|
May 5, 2021, 4:06 p.m. |
+ 1 |
for Task
Bigger Price
|
May 4, 2021, 8:38 a.m. |
+ 1 |
for
First-shinizlc
|
May 4, 2021, 8:38 a.m. |
+ 1 |
for
First-rathsankalp88
|
May 4, 2021, 8:35 a.m. |
+ 1 |
for
Second-mscislaw
|
Feb. 22, 2021, 6:38 p.m. |
+ 1 |
for Task
Split Pairs
|
Feb. 22, 2021, 10:37 a.m. |
+ 1 |
for Task
End Zeros
|
Feb. 22, 2021, 10:01 a.m. |
+ 1 |
for Task
Acceptable Password I
|