My code is of the order of n but still, it is giving TLE, can anyone fix the issue where am I making the mistake. My submission Problem B of latest codeforces round 712 DIV2
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
My code is of the order of n but still, it is giving TLE, can anyone fix the issue where am I making the mistake. My submission Problem B of latest codeforces round 712 DIV2
Name |
---|
That is not possible. You might have used some function in your submitted code that would have made your code's complexity not executable in time bounds.
Your isSame function runs in O(n) complexity just because every time you pass string the function creates a copy of both the strings.