| # | 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 | Um_nik | 3396 |
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | cry | 160 |
| 2 | maomao90 | 160 |
| 4 | -is-this-fft- | 159 |
| 5 | atcoder_official | 158 |
| 5 | awoo | 158 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | maroonrk | 152 |
| 10 | Dominater069 | 149 |
small strings (Google kick start round c)
my solution has time complexity of O(n*k) k = first k characters from a to z n = size of string but solution got TLE how to optimize it? link to the question and my solution:
https://codingcompetitions.withgoogle.com/kickstart/round/0000000000435c44/00000000007ebe5e
https://www.codechef.com/viewsolution/46839080
thanks in advance
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
rakeshgvpcoe123 | 2021-05-24 07:59:05 | 229 | ||
| en1 |
|
rakeshgvpcoe123 | 2021-05-24 07:57:35 | 517 | Initial revision (published) |
