# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
7 | adamant | 154 |
9 | Um_nik | 151 |
10 | djm03178 | 146 |
Name |
---|
Auto comment: topic has been updated by sahkumar.bishwash (previous revision, new revision, compare).
Inside of your solve function, these lines are technically O(n^2) since string concatenation is O(n) in python.
However, the compiler that python3 uses optimizes it to O(n) but pypy3's doesn't. I would recommend just adding each character to a list and joining them at the end with .join().